algorithms/findIntersectionofLists.java at master · kjayashr/algorithms · GitHub

1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
public class Solution {
    public ListNode getIntersectionNode(ListNode headA, ListNode headB) {

        int lengthA = 0;
        int lengthB = 0;
        ListNode tempA = headA;
          ListNode tempB = headB;
      /*This is a repetative function and can be modularized */
        while(tempA!=null)
        {
            tempA = tempA.next;
            lengthA++;
        }
        /*This is a repetative function and can be modularized */
         while(tempB!=null)
        {
            tempB = tempB.next;
            lengthB++;
        }


          while (lengthA > lengthB) {
        headA = headA.next;
        lengthA--;
    }

            while (lengthB > lengthA) {
        headB = headB.next;
        lengthB--;
    }

        while (headA != headB) {
        headA = headA.next;
        headB = headB.next;
    }
    return headA;


    }
}
//ls01/02