剑指 Offer 52. 两个链表的第一个公共节点
题目
代码
class Solution {
public:
ListNode *findFirstCommonNode(ListNode *headA, ListNode *headB) {
auto p = headA, q = headB;
while(p != q)
{
if(p)
p = p->next;
else
p = headB;
if(q)
q = q->next;
else
q = headA;
}
return p;
}
}

浙公网安备 33010602011771号