题
https://leetcode-cn.com/problems/intersection-of-two-linked-lists-lcci/
解题思路
此处撰写解题思路
大佬题解
代码
/**
* 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) {
if (!headA ||!headB)
{
return NULL;
}
ListNode *a = headA, *b = headB;
while (a||b){
if (a==NULL)
{
a = headB;
}
if (b == NULL)
{
b = headA;
}
if (a==b)
{
return a;
}
a = a->next;
b = b->next;
}
return NULL;
}
};