相交的地方之后长度肯定相等,换句话说,只有两个链表从后看长度相等的地方才能有相交的点,实现有点小复杂,但很简单。
/**
* Definition for singly-linked list.
* struct ListNode {
* int val;
* ListNode *next;
* ListNode(int x) : val(x), next(NULL) {}
* };
*/
class Solution {
public:
int length(ListNode * p)
{
int sum = 0;
while(p != NULL)
{
sum++;
p = p -> next;
}
return sum;
}
ListNode *getIntersectionNode(ListNode *headA, ListNode *headB) {
ListNode * p, * q;
p = headA;
q = headB;
int la, lb;
int temp;
la = length(headA);
lb = length(headB);
if(la > lb)
{
temp = la - lb;
for(p = headA; p != NULL && temp > 0;temp--)
{
p = p -> next;
}
}
if(la < lb)
{
temp = lb - la;
for(q = headB; q != NULL && temp > 0;temp--)
{
q = q -> next;
}
}
while(q != NULL)
{
if(q -> val == p -> val)
return q;
p = p -> next;
q = q -> next;
}
return NULL;
}
};