【LeetCode】【JAVA】【068】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.

思路：

双指针：求得两个list的长度差 lenDiff，长的list先走 lenDiff 步，再同时走。很有意思的算法。

详细：http://www.tuicool.com/articles/m2Mnuev

Code：

    public ListNode getIntersectionNode(ListNode headA, ListNode headB) {
        if(headA == null || headB ==null) return null;
        ListNode pa=headA,pb=headB;
        int lenA=0, lenB=0;
        while(pa != null) { pa=pa.next; lenA++;}
        while(pb != null) { pb =pb.next; lenB++;}
        if(lenA > lenB) 
            for(int i=0;i<lenA-lenB;i++){
                headA=headA.next;
            }
        else 
            for(int i=0;i<lenB-lenA;i++){
                headB = headB.next;
            }
        while(headA!=headB){
            headA=headA.next;
            headB=headB.next;
        }
        return headA;
    }

备注：

while 和 if 判断时不要啰嗦，尽量使用比较简洁的判断方法