-
Notifications
You must be signed in to change notification settings - Fork 0
/
Day 36
53 lines (45 loc) · 1.19 KB
/
Day 36
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
42
43
44
45
46
47
48
49
50
51
52
53
/**
* 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) {
int lenA = lengthOfLL(headA);
int lenB = lengthOfLL(headB);
// Difference between length of both LL
int x = lenA > lenB ? (lenA-lenB) : (lenB-lenA);
// Skip initial x nodes of bigger LL
if(lenA > lenB){
while(x !=0 ){
headA = headA.next;
x--;
}
}else{
while(x !=0 ){
headB = headB.next;
x--;
}
}
// traverse in both LL till u not get intersecton point
while(true){
if(headA == headB){
return headA;
}
headA = headA.next;
headB = headB.next;
}
}
private int lengthOfLL(ListNode head){
if(head == null){
return 0;
}
return 1 + lengthOfLL(head.next);
}
}