leetcode 160. Intersection of Two Linked Lists

最新推荐文章于 2023-12-11 10:18:28 发布

享受奔跑的过程

最新推荐文章于 2023-12-11 10:18:28 发布

阅读量212

点赞数

分类专栏： leetcode 文章标签： leetcode 链表

本文链接：https://blog.csdn.net/yanzhenbo1/article/details/52911553

版权

leetcode 专栏收录该内容

33 篇文章 0 订阅

订阅专栏

解题思路：

注意是节点相同，而不是节点的值相同。
对于两个链表
A: a1→a2→c1→c2→c3
B: b1→b2→b3→c1→c2→c3
由于长度不同，所以同时遍历无法对齐
A: a1→a2→c1→c2→c3  b1→b2→b3→**c1→c2→c3**
B: b1→b2→b3→c1→c2→c3  a1→a2→**c1→c2→c3**
经过这样的遍历，可以使相同的节点进行对齐

原题目：

Write a program to find the node at which the intersection of two singly linked lists begins.


For example, the following two linked lists:

A:          a1 → a2
                   ↘
                     c1 → c2 → c3
                   ↗            
B:     b1 → b2 → b3
begin to intersect at node c1.


Notes:
If the two linked lists have no intersection at all, return null.
The linked lists must retain their original structure after the function returns.
You may assume there are no cycles anywhere in the entire linked structure.
Your code should preferably run in O(n) time and use only O(1) memory.

AC解，C++代码，菜鸟一个，请大家多多指正

class Solution {
public:
    ListNode *getIntersectionNode(ListNode *headA, ListNode *headB) {
        ListNode* pa = headA;
        ListNode* pb = headB;
        if (pa == pb) return pa;
        while (pa && pb) {
            pa = pa->next;
            pb = pb->next;
            if (pa == pb) return pa;

            if (pa == NULL) pa = headB;
            if (pb == NULL) pb = headA;
            if (pa == pb) return pa;
        }
        return NULL;
    }
};