[LeetCode] 160. Intersection of Two Linked Lists

题：https://leetcode.com/problems/intersection-of-two-linked-lists/description/

#题目
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.

#思路
若两条链，有共有的链。那么从尾端倒数，公共节点 的倒数序号相同。
设有两个 p。ap，bp。
将每个指针p分别遍历headA+headB 和 headB+headA 链。当ap在headA+headB 中 headB时 ，bp 在headB+headA 中 headA时，两者的倒数的计数相同。
若有公共链，则 ap == bp != None。
否则，ap 与 bp 会遍历到 链尾，最终均为None。

code

# Definition for singly-linked list.
# class ListNode(object):
#     def __init__(self, x):
#         self.val = x
#         self.next = None

class Solution(object):
    def getIntersectionNode(self, headA, headB):
        """
        :type head1, head1: ListNode
        :rtype: ListNode
        """
        if headA == None or headB == None:
            return None
        
        ap = headA
        bp = headB
        
        while bp != ap:
            ap = ap.next if ap != None else headB
            bp = bp.next if bp != None else headA
        return ap

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