Write a program to find the node at which the intersection >of two singly linked lists begins.
For example, the following two linked lists:
思路:两个链表先遍历一遍求出对应长度,长的那个从头开始先走两者的差值的步数,这样再遍历式则一定会同时走到交点
/**
* 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) {
//思路:两个链表分别遍历一遍求出长度,长的链表从头先走两者的差值步数,
//这样第二次遍历肯定能保证同时交汇,否者没有共同点
int lengthA = 0;
int lengthB = 0;
ListNode* tempA = headA;
ListNode* tempB = headB;
while(tempA)
{
lengthA++;
tempA = tempA->next;
}
while(tempB)
{
lengthB++;
tempB= tempB->next;
}
int dif = lengthA - lengthB;
if(dif > 0)
{
while(dif)
{
headA = headA->next;
dif--;
}
}
else
{
dif = -dif;
while(dif)
{
headB = headB->next;
dif--;
}
}
while(headA && headB)
{
if(headA == headB)
{
return headA;
}
headA = headA->next;
headB = headB->next;
}
return NULL;
}
};