-
Notifications
You must be signed in to change notification settings - Fork 0
/
Copy path160.cpp
27 lines (26 loc) · 910 Bytes
/
160.cpp
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
/*************************************************************************
> File Name: 160.cpp
> Author: 北海望谷堆
> Mail: [email protected]
> Created Time: Tue 09 Jun 2020 06:09:54 PM CST
************************************************************************/
/**
* Definition for singly-linked list.
* struct ListNode {
* int val;
* ListNode *next;
* ListNode(int x) : val(x), next(NULL) {}
* };
*/
class Solution {
public:
ListNode *getIntersectionNode(ListNode *headA, ListNode *headB) {
if (!headA || !headB) return NULL;
ListNode *pa = headA, *pb = headB;
while (pa != pb) { // 若是有缘,你们早晚会相遇
pa = pa ? pa->next : headB; // 当你走到终点时,开始走她走过的路
pb = pb ? pb->next : headA; // 当她走到终点时,开始走你走过的路
}
return pa;
}
};