160. 相交链表

最新推荐文章于 2024-09-09 18:27:53 发布

碰碰狗

最新推荐文章于 2024-09-09 18:27:53 发布

阅读量81

点赞数

分类专栏： Leetcode刷题笔记（C++）文章标签： leetcode 链表双指针哈希表

本文链接：https://blog.csdn.net/suitaox26456/article/details/127280275

版权

Leetcode刷题笔记（C++）专栏收录该内容

29 篇文章 0 订阅

订阅专栏

方法一：双指针

1.1：自己写的

时间复杂度：O(n+m)

空间复杂度：O(1)

class Solution
{
public:
    ListNode* getIntersectionNode(ListNode* headA, ListNode* headB)
    {
        int lenA = 0;
        int lenB = 0;
        ListNode* pA = headA;
        ListNode* pB = headB;

        while (pA != nullptr)
        {
            lenA++;
            pA = pA->next;
        }
        while (pB != nullptr)
        {
            lenB++;
            pB = pB->next;
        }

        if (lenA > lenB)
        {
            int dif = lenA - lenB;
            pA = headA;
            pB = headB;
            for (int i = 0; i < dif; i++)
            {
                pA = pA->next;
            }
            while (pA != nullptr || pB != nullptr)
            {
                if (pA == pB)
                {
                    return pA;
                }
                pA = pA->next;
                pB = pB->next;
            }

            return nullptr;
        }

        int dif = lenB - lenA;
        pA = headA;
        pB = headB;
        for (int i = 0; i < dif; i++)
        {
            pB = pB->next;
        }
        while (pA != nullptr || pB != nullptr)
        {
            if (pA == pB)
            {
                return pB;
            }
            pA = pA->next;
            pB = pB->next;
        }

        return nullptr;
    }
};

1.2 官方解法

时间复杂度：O(n+m)

空间复杂度：O(1)

class Solution
{
public:
    ListNode* getIntersectionNode(ListNode* headA, ListNode* headB)
    {
        ListNode* pA = headA;
        ListNode* pB = headB;

        while (pA != pB)
        {
            pA = (pA != nullptr) ? pA->next : headB;
            pB = (pB != nullptr) ? pB->next : headA;
        }

        return pA;
    }
};