LeetCode 0160 - Intersection of Two Linked Lists

Reck Zhang

发布于 2021-08-11 14:52:31

2300

发布于 2021-08-11 14:52:31

文章被收录于专栏：Reck Zhang

Intersection of Two Linked Lists

Desicription

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.

Solution

/**
 * Definition for singly-linked list.
 * struct ListNode {
 *     int val;
 *     ListNode *next;
 *     ListNode(int x) : val(x), next(NULL) {}
 * };
 */
class Solution {
public:
    ListNode *getIntersectionNode(ListNode *headA, ListNode *headB) {
        ListNode* pA = headA;
        ListNode* pB = headB;
        while(pA != pB) {
            pA = pA?pA->next:headB;
            pB = pB?pB->next:headA;
        }
        return pA;
    }
};

本文参与腾讯云自媒体同步曝光计划，分享自作者个人站点/博客。

原始发表：2018-06-03，如有侵权请联系 cloudcommunity@tencent.com 删除

node.js

本文分享自作者个人站点/博客前往查看

如有侵权，请联系 cloudcommunity@tencent.com 删除。

本文参与腾讯云自媒体同步曝光计划，欢迎热爱写作的你一起参与！

node.js

登录后参与评论

0 条评论

热度

LeetCode 0160 - Intersection of Two Linked Lists

LeetCode 0160 - Intersection of Two Linked Lists

Intersection of Two Linked Lists

Desicription

Solution

社区

活动

资源

关于

腾讯云开发者

热门产品

热门推荐

更多推荐