leetcode/160.c
2024-09-08 14:39:20 +08:00

24 lines
407 B
C

#include <ListNode.h>
#include <stdio.h>
struct ListNode *getIntersectionNode(struct ListNode *headA, struct ListNode *headB)
{
if (headA == NULL || headB == NULL)
return NULL;
struct ListNode *pA = headA, *pB = headB;
while (pA != pB)
{
pA = pA == NULL ? headB : pA->next;
pB = pB == NULL ? headA : pB->next;
}
return pA;
}
int main()
{
return 0;
}