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.

Subscribe to see which companies asked this question

/**
 * 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 temp1=headA;
        ListNode temp2=headB;
        
        int num1=0,num2=0;
        
        while(temp1!=null){
            num1++;
            temp1=temp1.next;
        }
        while(temp2!=null){
            num2++;
            temp2=temp2.next;
        }
        int i=0;
        if(num1>num2){
            while(i++<num1-num2){
                headA=headA.next;
            }
        }
        else if(num1<num2){
            while(i++<num2-num1){
                headB=headB.next;
            }
        }
        while(headA!=null&&headB!=null){
            
            if(headA==headB) return headA;
            headA=headA.next;
            headB=headB.next;
        }
        
        return null;
}
}