Intersection of Two Linked Lists
题目描述:
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:
- If the two linked lists have no intersection at all, return
null
. - The linked lists must retain their original structure after the function returns.
- You may assume there are no cycles anywhere in the entire linked structure.
- Your code should preferably run in O(n) time and use only O(1) memory.
题目思路:
声明两个指针,分别指向两个链表的头节点。然后同时向后移动,如果当前链表的指针到达链表尾部,则开始指向另一个链表的头节点,继续遍历。
如果两个指针指向的元素相同,那么该位置元素就是两个链表的相交点的开始位置。
试想:
链表A:1 4 5 6 7 5 6 7 8 9
链表B: x x x 2 3 5 6 7 8 9
其中x表示没有元素,明显B链表先遍历完成,然后开始转向遍历A,他会在另一个指针转向B的时候遍历完x对应的三个元素。因此只要两个指针对应元素相同就是要求的结果。
其实分别从两个链表的最后一个元素开始遍历,一一对应,进行比较,直到元素不同即可(当然是遍历这个元素之前的那个元素)。
题目代码:
/**
* 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) {
ListNode *pA = headA, *pB = headB;
while(pA != pB){
pA = pA == nullptr ? headB : pA->next;
pB = pB == nullptr ? headA : pB->next;
}
return pA;
}
};