160. 相交链表
题目描述:
编写一个程序,找到两个单链表相交的起始节点。
如下面的两个链表:
解题思路:
python代码实现:
class Solution(object):
def getIntersectionNode(self, headA, headB):
"""
:type head1, head1: ListNode
:rtype: ListNode
"""
if headA == None or headB == None:
return None
# 统计两链表长度
tagA = headA
len_A = 0
while tagA != None:
len_A += 1
tagA = tagA.next
tagB = headB
len_B = 0
while tagB != None:
len_B += 1
tagB = tagB.next
if len_A == len_B:
# 两链表一起向前走,直到相交为止
while headA != headB:
headA = headA.next
headB = headB.next
return headA