本文共 1591 字,大约阅读时间需要 5 分钟。
# Definition for singly-linked list.# class ListNode(object):# def __init__(self, x):# self.val = x# self.next = Noneclass Solution(object): def getIntersectionNode(self, headA, headB): """ :type head1, head1: ListNode :rtype: ListNode """ length_a = 0 length_b = 0 copy_headA = headA copy_headB = headB while copy_headA != None: length_a += 1 copy_headA = copy_headA.next while copy_headB != None: length_b += 1 copy_headB = copy_headB.next diff = abs(length_a - length_b) if length_a > length_b: while diff > 0: headA = headA.next diff -= 1 if length_b > length_a: while diff > 0: headB = headB.next diff -= 1 while headA != None: if headA == headB: return headA headA = headA.next headB = headB.next return None
转载地址:http://hmbvb.baihongyu.com/