Leetcode刷题记录——剑指 Offer 52. 两个链表的第一个公共节点

1996MZH

于 2020-07-24 00:37:26 发布

阅读量105

点赞数

分类专栏： leetcode python编程技巧

本文链接：https://blog.csdn.net/weixin_41545780/article/details/107551326

版权

python编程技巧同时被 2 个专栏收录

286 篇文章 0 订阅

订阅专栏

leetcode

254 篇文章 0 订阅

订阅专栏

在这里插入图片描述

双指针各指一个链表的head
同步前进
当一个是None的时候
另一个继续前进前进K步到None
记录K
然后双指针重新从各自的头指针开始走
长的先走K步
而后两个一起走
相交时即为所求

# 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:
        cur1 = headA
        cur2 = headB
        while cur1 != None and cur2 != None:
            cur1 = cur1.next
            cur2 = cur2.next
        K = 0#O(1)的空间复杂度
        if cur1 != None:
            while cur1 != None:
                cur1 = cur1.next
                K += 1
                short_ll = headB
                long_ll = headA
        elif cur2 != None:
            while cur2 != None:
                cur2 = cur2.next
                K += 1
                short_ll = headA
                long_ll = headB
        else:
            K = 0
            short_ll = headA
            long_ll = headB
        for i in range(K):
            long_ll = long_ll.next
        while long_ll != short_ll:
            long_ll = long_ll.next
            short_ll = short_ll.next
        return long_ll