leetcode160.intersection of two linked lists

笃定1109

于 2020-06-21 23:42:33 发布

阅读量164

点赞数

文章标签： leetcode

本文链接：https://blog.youkuaiyun.com/weixin_40378100/article/details/106893426

版权

class ListNode(object):
    def __init__(self,x):
        self.val = x
        self.next = None

class Solution(object):
    def getIntersectionNode(self,headA,headB):
        p1 = headA
        p2 = headB

        while p1 !=p2:
            if not p1:
                p1 = headB
            else:
                p1 = p1.next
            if not p2:
                p2 =headA
            else:
                p2 = p2.next
                #只要两个链表都走过的话，走过的长度是一定相同的