Leetcode在链接列表之间合并

Question

我试图解决的问题的措辞如下：

您将获得两个链表：大小分别为n和m的list1和list2。从ath节点到bth节点删除list1的节点，并将list2放置到位。

我将我的解决方案写成：

    def mergeInBetween(self, list1: ListNode, a: int, b: int, list2: ListNode) -> ListNode:
        count = 1
        curr = list1
        while count < a:
            curr = curr.next
            count += 1
        curr2 = curr
        while count < b:
            curr2 = curr.next
            count += 1
        curr.next = list2
        curr3 = list2
        while curr3.next:
            curr3 = curr3.next
        curr3.next = curr2
        return list1
        

我很难理解为什么它不起作用。我似乎找不到我的错误

Answer 1

两个小错误：

1. 更换电流2=电流。下一步，使用curr2=curr2。下一步。我相信这只是你的一个错误
2. <代码>计数时

def mergeInBetween(self, list1: ListNode, a: int, b: int, list2: ListNode) -> ListNode:
        count = 1
        curr = list1
        while count < a:
            curr = curr.next
            count += 1
        curr2 = curr
        while count <= b + 1:
            curr2 = curr2.next
            count += 1
        curr.next = list2
        curr3 = list2
        while curr3.next:
            curr3 = curr3.next
        curr3.next = curr2
        return list1