Write a program to find the node at which the intersection of two singly linked lists begins.
For example, the following two linked lists:
A: a1 → a2 ↘ c1 → c2 → c3 ↗ B: b1 → b2 → b3
begin to intersect at node c1.
这题首先需要双指针,最开始的两种思路是1.AB指针分别各自循环,2.AB指针分别看两步走一步。这两个思路最终都没通过,原因在于两个链表的长度差没有得到有效解决。最后参考了论坛,通过交换指针的方式来完成。这种方法的时间复杂度受链表的长度和长度差影响。以下代码及参考链接。暂时没有想到更好的方法,期待之后的进步
# Definition for singly-linked list.
# class ListNode(object):
# def __init__(self, x):
# self.val = x
# self.next = None
class Solution(object):
def getIntersectionNode(self, headA, headB):
"""
:type head1, head1: ListNode
:rtype: ListNode
"""
# 检查是否为null
if headA != None and headB != None:
pa = headA
pb = headB
else:
return None
# 判断两个链表当前node是否交叉
while pa != pb:
# 判断指针是否触尾,是:转到另一个链表初始位置。否:移动到当前链表下一节点
if pa != None:
pa = pa.next
else:
pa = headB
if pb != None:
pb = pb.next
else:
pb = headA
return pa
参考: