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.

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

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

假设Ａ链表长度为ｍ，Ｂ链表长度为ｎ。则在循环进行（ｍ＋ｎ）次后指针ｐ和ｑ都指向了NULL。这个时候循环退出，返回p=NULL.

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

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

/**
 * 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;
    }
};