AcWing 66. 两个链表的第一个公共结点
原题链接
简单
作者:
Samuely
,
2022-12-13 14:25:03
,
所有人可见
,
阅读 162
/**
* Definition for singly-linked list.
* struct ListNode {
* int val;
* ListNode *next;
* ListNode(int x) : val(x), next(NULL) {}
* };
*/
class Solution {
public:
ListNode *findFirstCommonNode(ListNode *headA, ListNode *headB) {
ListNode *p = headA, *q = headB;
if (p == NULL || q == NULL) return NULL;
while(p != q)
{
if (p != NULL) p = p->next;
else p = headB;
if (q != NULL) q = q->next;
else q = headA;
}
return p;
}
};