/**
* 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) {
auto p=headA,q=headB;
while(p!=q)
{
if(!q) q=headA;
else q=q->next;
if(!p) p=headB;
else p=p->next;
}
return p;
}
};
LeetCode 160. 相交链表
发布时间 2023-07-05 18:46:31作者: 穿过雾的阴霾