Leetcode刷题记录——160. 相交链表

最新推荐文章于 2022-12-09 09:55:48 发布

1996MZH

最新推荐文章于 2022-12-09 09:55:48 发布

阅读量90

点赞数

分类专栏： leetcode python编程技巧

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

版权

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

286 篇文章 0 订阅

订阅专栏

leetcode

254 篇文章 0 订阅

订阅专栏

在这里插入图片描述

如
1 2 3和
1 2
两指针分别指A和B的头
向前走，当一个走到None时切到另一个的头部
当二者重合时，返回该结果即可

# 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 != cur2:
            cur1 = cur1.next if cur1 != None else headB
            cur2 = cur2.next if cur2 != None else headA
        return cur1 if cur1 != None else None

先将两个链表的尾部对其，然后从较短一个的头部位置开始，逐个查找是否有相等的节点

# 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:
        len1 = 0
        len2 = 0
        cur1 = headA
        cur2 = headB
        while cur1 is not None:
            len1 += 1
            cur1 = cur1.next
        while cur2 is not None:
            len2 += 1
            cur2 = cur2.next
        if len1 != len2:
            todo = headA if len1 > len2 else headB
            wait = headB if len1 > len2 else headA
            for i in range(abs(len1-len2)):
                todo = todo.next
        else:
            todo = headA
            wait = headB
        cur1 = todo
        cur2 = wait
        while cur1 is not None:
            if cur1 == cur2:
                return cur1
            else:
                cur1 = cur1.next
                cur2 = cur2.next
        return None