###### Intersection of Two Linked Lists
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.

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

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

/**
* struct ListNode {
*     int val;
*     ListNode *next;
*     ListNode(int x) : val(x), next(NULL) {}
* };
*/
class Solution {
public:
while(p!=q)
{
}
return p;
}
};

#### LeetCode 160 — Intersection of Two Linked Lists（C++ Python）

2014-12-02 20:59:16

#### leetcode 160: Intersection of Two Linked Lists

2014-12-30 03:17:29

#### [leetcode]Intersection of Two Linked Lists　——　熟悉python

2014-12-11 11:41:03

#### 【LeetCode】Intersection of Two Linked Lists

2014-11-27 21:55:23

2016-01-24 09:26:28

#### 160. Intersection of Two Linked Lists（python）

2016-09-18 21:38:02

#### 【LeetCode-面试算法经典-Java实现】【160-Intersection of Two Linked Lists（单链表的交集）】

2015-08-22 06:45:36

#### LeetCode 160 ：Intersection of Two Linked Lists

2015-05-14 22:06:04

2015-09-14 10:16:22

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

2014-11-28 00:15:09