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.

方法：让P1,P2两人同时在两个链表头结点出发开始走，直到其中一个人走到了末尾（假设p1走到末尾），此时他应立即回到另一个链表的头结点开始走， 注意必须是另一个链表的头结点! 两人继续走呀走，然后第二个人p2走到了末尾，此时p1所处的位置正好是两个链表的长度差diff， 此时再让p2切换链表继续和p2往前走，如果他们相遇，那么相遇节点即为交叉点； 

代码如下：

/**
 * 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 *p1 = headA;
        ListNode *p2 = headB;

        // 循环退出的条件为两者相遇，这种情况包含了都为null的情况
        while (p1 != p2) {
            p1 = (p1 == NULL ? headB : p1->next);
            p2 = (p2 == NULL ? headA : p2->next);

        }

        return p1;}
};