160. 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.

Credits:
Special thanks to @stellari for adding this problem and creating all test cases.

这道题是找两个list有没有重复，换句话说如果有重复，那么两个list后半部分是相同的。那么，a+b，b+a的后半部分也是相同的，那么下面的代码就很巧妙了：

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

当存在重叠时，a和b会在重叠的地方跳出while，如果没有重叠，a和b会在a+b的末尾处同为null跳出while循环，最后返回a，b都行。

Tips：想问题时可以从merge的角度来想。