题目:
# Definition for singly-linked list.
# class ListNode:
# def __init__(self, x):
# self.val = x
# self.next = None
class Solution:
def getIntersectionNode(self, headA: ListNode, headB: ListNode) -> ListNode:
reservoir = set()
myNode1 = headA
myNode2 = headB
while myNode1:
reservoir.add(myNode1)
myNode1 = myNode1.next
while myNode2:
if myNode2 in reservoir:
return myNode2
myNode2 = myNode2.next
return None