Intersection of Two Linked Lists

原创 2016年06月01日 11:14:35
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.

题目:要求返回两个链表相交的节点。如果没有相交的节点则返回NULL

(1)当没有相交节点的情况下:

假设A链表长度为m,B链表长度为n。则在循环进行(m+n)次后指针p和q都指向了NULL。这个时候循环退出,返回p=NULL.

(2)当两个链表有相同交点的时候:

设A和B公共部分链表的长度为m,A链表head节点距离相交节点的长度为x,B链表head节点距离相交节点的长度为y,则在循环经历了(x+y+m)次之后两者必定在公共第一个公共节点处相等。返回p,相等的节点即为题目所求。

/**
 * 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 *p=headA,*q=headB;
        while(p!=q)
        {
            p=p?p->next:headB;
            q=q?q->next:headA;
        }
        return p;
    }
};


版权声明:本文为博主原创文章,未经博主允许不得转载。

相关文章推荐

leetcode-160-Intersection of Two Linked Lists

Intersection of Two Linked Lists Write a program to find the node at which the intersection of two...

Intersection of Two Linked Lists leetcode

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

Leetcode: Intersection of Two Linked Lists

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

LeetCode (160) Intersection of Two Linked Lists

题目Write a program to find the node at which the intersection of two singly linked lists begins. For...
  • fly_yr
  • fly_yr
  • 2015年11月13日 13:10
  • 436

【Leetcode】:Intersection of Two Linked Lists

题目链接:https://oj.leetcode.com/problems/intersection-of-two-linked-lists/ 分析:题目就是求两个链表的的第一个交点,如果没有交点...

160. Intersection of Two Linked Lists

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

[LeetCode]problem 160. Intersection of Two Linked Lists

TAG求两个无环链表第一个相交节点 题目链接方法MD智障啊。真是不服不行。编程之美上有一个基础的问题,只判断是否相交;然后后续有个问题就是如果需要找第一个相交节点该怎么办?当时我随便一想,觉得应该没有...

【leetcode 两个链表的交集点】Intersection of Two Linked Lists

leetcode上最新的面试题目,求两个链表的交集,难度为easy,附个人理解解析以及题目作者的英文解析。...

Leetcode之Intersection of Two Linked Lists

leetcode之Intersection of Two Linked Lists分析,双指针

[LeetCode] Intersection of Two Linked Lists

Intersection of Two Linked Lists   Write a program to find the node at which the intersection ...
内容举报
返回顶部
收藏助手
不良信息举报
您举报文章:Intersection of Two Linked Lists
举报原因:
原因补充:

(最多只允许输入30个字)