标签：
Write a program to find the node at which the intersection of two singly linked lists begins.
For example, the following two linked lists:
A: a1 → a2
↘
c1 → c2 → c3
↗
B: b1 → b2 → b3
begin to intersect at node c1.
Notes:
null.Credits:
Special thanks to @stellari for adding this problem and creating all test cases.
Subscribe to see which companies asked this question
c++ code:
/**
* 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;
int cntA=0,cntB=0;
ListNode *pa=headA, *pb=headB;
while(pa)
{
pa=pa->next;
cntA++;
}
while(pb)
{
pb=pb->next;
cntB++;
}
pa=headA,pb=headB;
while(cntB < cntA)
{
pa=pa->next;
cntA--;
}
while(cntA < cntB)
{
pb=pb->next;
cntB--;
}
while(pa && pb) {
if(pa == pb) break;
else{
pa=pa->next;
pb=pb->next;
}
}
return pa;
}
};LeetCode:Intersection of Two Linked Lists
标签：
原文地址：http://blog.csdn.net/itismelzp/article/details/51331427
