题目描述(easy):
Write a program to find the node at which the intersection of two singly linked lists begins.
本题就是要寻找两个链表交汇的点,方法很多,最简单直接的方法就是找出两个链表中较长的一个,遍历长的直到两条链表长度相同时再两个一起遍历,相等时就是交汇点。
/**
* Definition for singly-linked list.
* struct ListNode {
* int val;
* ListNode *next;
* ListNode(int x) : val(x), next(NULL) {}
* };
*/
class Solution {
public:
int getLength(ListNode *l)
{
auto count = 0;
while(l)
{
count ++;
l = l->next;
}
return count;
}
ListNode *getIntersectionNode(ListNode *headA, ListNode *headB) {
int la = getLength(headA);
int lb = getLength(headB);
int dis = la - lb;
if(dis > 0)
while(--dis >= 0)
headA = headA->next;
else
while(++dis <=0)
headB = headB->next;
while(headA != headB)
{
headA = headA->next;
headB = headB->next;
}
return headA;
}
};```