Intersection of Two Linked Lists answer [Easy]

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.

=======================================Answer=========================================================

/**
 * 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;
        
        int headALength = 1;
        int headBLength = 1;
        int gap = 0;
        ListNode tempA = headA;
        ListNode tempB = headB;
        
        while(tempA.next!=null) {
            tempA = tempA.next;
            headALength++;
            
        }
        
        while(tempB.next!=null) {
            tempB = tempB.next;
            headBLength++;
            
        }
        
        if(tempA!=tempB) return null;
        else{
            gap =  headBLength-headALength;
            tempA = headA;   
            tempB = headB;
        }
        
        if(gap == 0) {
            
            while(tempA!=tempB) {
                
                tempA = tempA.next;
                tempB = tempB.next;
            }
            return tempA;
        
        }
        
        else if (gap  > 0) {
            while(gap>0) {
                tempB = tempB.next;
                gap--;
                
            }
            
           while(tempA!=tempB) {
                
                tempA = tempA.next;
                tempB = tempB.next;
            }
            return tempA;
            
        }
        
       else if (gap   < 0) {
            while(gap<0) {
                tempA = tempA.next;
                gap++;
                
            }
            
             while(tempA!=tempB) {
                
                tempA = tempA.next;
                tempB = tempB.next;
            }
            return tempA;
            
            
        }
        return null;
}
}