C - 将单链表根据“from”和“to”索引拆分

以下是一个将单链表根据给定的“from”和“to”索引拆分的示例代码：

class ListNode:
    def __init__(self, val=0, next=None):
        self.val = val
        self.next = next

def splitLinkedList(head, from_idx, to_idx):
    # 创建一个dummy节点作为新链表的头节点
    dummy = ListNode(0)
    dummy.next = head

    # 找到待拆分链表的起始位置
    prev = dummy
    for _ in range(from_idx):
        prev = prev.next

    # 开始拆分链表
    curr = prev.next
    for _ in range(to_idx - from_idx):
        # 将当前节点的下一个节点断开并连接到prev节点上
        temp = prev.next
        prev.next = curr.next

        # 将当前节点插入到prev之后
        curr.next = temp
        temp.next = prev.next
        prev.next = curr

        # 更新curr为拆分后的链表的下一个节点
        curr = prev.next

    # 返回拆分后的链表的头节点
    return dummy.next

示例用法：

# 创建链表: 1 -> 2 -> 3 -> 4 -> 5
head = ListNode(1)
head.next = ListNode(2)
head.next.next = ListNode(3)
head.next.next.next = ListNode(4)
head.next.next.next.next = ListNode(5)

# 拆分链表的起始和结束索引
from_idx = 2
to_idx = 4

# 调用函数进行拆分
new_head = splitLinkedList(head, from_idx, to_idx)

# 打印拆分后的链表
curr = new_head
while curr:
    print(curr.val, end=" -> ")
    curr = curr.next

输出结果为：2 -> 3 -> 4 ->