/**
* 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) {
ListNode* pa=headA;
ListNode* pb=headB;
while(pa!=pb){
pa=(pa==nullptr)? headB:pa->next;
pb=(pb==nullptr)? headA:pb->next;
}
if(pa==nullptr)
return nullptr;
else
return pa;
}
};
06-30
777
![](https://csdnimg.cn/release/blogv2/dist/pc/img/readCountWhite.png)
03-15
138
![](https://csdnimg.cn/release/blogv2/dist/pc/img/readCountWhite.png)
02-18
139
![](https://csdnimg.cn/release/blogv2/dist/pc/img/readCountWhite.png)
07-24
866
![](https://csdnimg.cn/release/blogv2/dist/pc/img/readCountWhite.png)