LeetCode-160相交链表

题目：
下面代码相当于将A和B首尾连接起来，遍历一遍

class Solution:
    def getIntersectionNode(self, headA: ListNode, headB: ListNode) -> ListNode:
        n1, n2 = headA, headB
        while n1!=n2:  # while循环实现的效果为上图内容
            n1 = n1.next if n1 else headB # n1从A链表从头指向链尾，再从headB的链头指向链尾
            n2 = n2.next if n2 else headA
        return n1 # 当n1=n2时循环结束，返回此时的n1则为链表相交的节点的数值

还有另一种方法，就是讲A链表的节点逐个放到set()中，然后遍历B链表，看看B中有哪些数在A中
class Solution:
def getIntersectionNode(self, headA: ListNode, headB: ListNode) -> ListNode:
head = set()
while headA:
head.add(headA)
headA = headA.next
while headB:
if headB in head:
return headB
headB = headB.next
return None