LeetCode160 相交链表

最新推荐文章于 2024-03-03 08:41:49 发布

琪琪汉娜

最新推荐文章于 2024-03-03 08:41:49 发布

阅读量101

点赞数

分类专栏： LeetCode

本文链接：https://blog.csdn.net/weixin_43678298/article/details/108030225

版权

LeetCode 专栏收录该内容

21 篇文章 0 订阅

订阅专栏

题目描述

解题

寻找链表相交点用浪漫的解法
A+B=B+A

class Solution:
    def getIntersectionNode(self, headA: ListNode, headB: ListNode) -> ListNode:
        pa = headA
        pb = headB
        flagA = 0
        flagB = 0
        if not pa or not pb:
            return None
        while flagA!=2 and flagB!=2:
            if pa == pb:
                return pa
            if pa.next:
                pa = pa.next
            elif pa.next == None and flagA == 0:
                pa = headB
                flagA = flagA + 1
            elif pa.next == None and flagA ==1:
                flagA = flagA + 1
            if pb.next:
                pb = pb.next
            elif pb.next == None and flagB == 0:
                pb = headA
                flagB = flagB + 1
            elif pb.next == None and flagB ==1:
                flagB = flagB + 1
        return None