160. Intersection of Two Linked Lists

题目

Write a program to find the node at which the intersection of two singly linked lists begins.

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.

我的想法

难点在于O(n) time and use only O(1) memory

解答

找到两链表长度的差值，让长的先走到尾部长度与短的相同。返回第一个相等的值，否则返回null

public class Solution {
    public ListNode getIntersectionNode(ListNode headA, ListNode headB) {
        ListNode dummyA = headA;
        ListNode dummyB = headB;
        int lenA = 0, lenB = 0;
        while(dummyA != null) {
            lenA++;
            dummyA = dummyA.next;
        }
        while(dummyB != null) {
            lenB++;
            dummyB = dummyB.next;
        }
        int diff = lenA - lenB;
        if(diff >= 0) {
            while(diff != 0) {
                diff--;
                headA = headA.next;
            }
        } else {
            while(diff != 0) {
                diff++;
                headB = headB.next;
            }
        }
        while(headA != null) {
            if(headA == headB) {
                return headA;
            }
            headA = headA.next;
            headB = headB.next;
        }
        return null;
    }
}