-
Notifications
You must be signed in to change notification settings - Fork 0
Expand file tree
/
Copy pathintersectionOfTwoLinkedList.cpp
More file actions
61 lines (57 loc) · 1.31 KB
/
intersectionOfTwoLinkedList.cpp
File metadata and controls
61 lines (57 loc) · 1.31 KB
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
54
55
56
57
58
59
60
61
/**
*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.
*/
class Solution {
public:
ListNode *getIntersectionNode(ListNode *headA, ListNode *headB) {
if(headA == NULL || headB == NULL)
return NULL;
int countA = 0, countB = 0;
ListNode* cur = headA;
while(cur != NULL)
{
countA++;
cur = cur->next;
}
cur = headB;
while(cur != NULL)
{
countB++;
cur = cur->next;
}
int a = countA - countB;
if(a >= 0)
{
while(a)
{
headA = headA->next;
a--;
}
}
else
{
a = -a;
while(a)
{
headB = headB->next;
a--;
}
}
while(headA != headB)
{
headA = headA->next;
headB = headB->next;
}
if(headA == NULL)
return NULL;
else
return headA;
}
};