def getIntersectionNode(headA, headB):
if not headA or not headB:
return None
tmp = set()
while headA and headB:
if headA not in tmp:
tmp.add(headA)
else:
return headA.val
if headB not in tmp:
tmp.add(headB)
else:
return headB.val
headA = headA.next
headB = headB.next
return None
def getIntersectionNode2(headA, headB):
if not headA or not headB:
return None
tmp = set()
while headA:
tmp.add(headA)
headA = headA.next
while headB:
if headB in tmp:
return headB
headB = headB.next
return None
160_相交链表
最新推荐文章于 2020-01-08 22:56:08 发布