【Leetcode】160. Intersection of Two Linked Lists[Easy]

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->c1->c2->c3

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.

Example

Example 1:

Input: intersectVal = 8, 
       listA = [4,1,8,4,5], listB = [5,0,1,8,4,5], 
       skipA = 2, skipB = 3
Output: Reference of the node with value = 8
Input Explanation: 
The intersected node's value is 8.
(Note that this must not be 0 if the two lists intersect.)
From the head of A, it reads as [4,1,8,4,5]. 
From the head of B, it reads as [5,0,1,8,4,5]. 
There are 2 nodes before the intersected node in A.
There are 3 nodes before the intersected node in B.

Example 2:

Input: intersectVal = 2, 
       listA = [0,9,1,2,4], listB = [3,2,4], 
       skipA = 3, skipB = 1
Output: Reference of the node with value = 2
Input Explanation: 
The intersected node's value is 2 .
(Note that this must not be 0 if the two lists intersect.)
From the head of A, it reads as [0,9,1,2,4]. 
From the head of B, it reads as [3,2,4]. 
There are 3 nodes before the intersected node in A.
There are 1 node before the intersected node in B.

Example 3:

Input: intersectVal = 0, 
       listA = [2,6,4], listB = [1,5], 
       skipA = 3, skipB = 2
Output: null
Input Explanation: 
From the head of A, it reads as [2,6,4]. 
From the head of B, it reads as [1,5]. 
Since the two lists do not intersect, intersectVal must be 0, 
while skipA and skipB can be arbitrary values.
Explanation: The two lists do not intersect, so return null.

Solving

There is a little trick in finding the length difference between two linked lists without counting nodes:

• Set two pointers pA and pB point to headA and headB.
• Moving pA to the next one until pA == null, then pA points to headB. At the same time, moving pB to the next one until pB == null, then pB points to headA.
• When pA points to node in listB and pB points to node in listA, you will find out that the rest of nodes after pA equals to pB.
• If there is a intersection between them, pA will finally be same as pB. Otherwise, pA and pB will point to null at the same time.

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