题目:
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.
1、边界条件:链表长度 为0时,必返回null
2、链表无环
3、时间复杂度O(n),空间复杂度O(1) --> 有限次遍历链表 + 有限自定义变量(指针数量无限制!比如要求without extra spaces,可以添加指针)
思路:
0、排除边界情况后,考虑将两条链表右对齐,则若是有交叉节点的话,从右端开始的一部分节点共有,左端的非交叉节点分开两支(帮助2理解)
1、两个链表的长度未知且任意给定,故先分别求出链表长度
2、由长度可知哪一只链表长度较长,可以将长链表的head指针向后移动若干个节点,保证两个链表的head指针从同一竖直位置开始遍历链表值
3、遍历过程中遇到相同节点,返回该节点。没有相同节点返回null
复杂度:
1、时间:两次求链表长度 + 一次遍历 --> O(n)
2、空间:两个变量分别存储链表长度 --> O(1)
代码:
/**
* 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 == nullptr || headB == nullptr) return nullptr;
ListNode* pa = headA;
ListNode* pb = headB;
int lenA = getLength(pa);
int lenB = getLength(pb);
(lenA >= lenB) ? moveHead(pa, lenA - lenB) : moveHead(pb, lenB - lenA);
while (pa != nullptr)
{
if (pa == pb)
return pa;
else
{
pa = pa->next;
pb = pb->next;
}
}
return nullptr;
}
int getLength(ListNode* head)
{
if (head == nullptr) return 0;
int length = 0;
while (head != nullptr)
{
head = head->next;
length++;
}
return length;
}
ListNode* moveHead(ListNode* &head, int n)
{
while (n > 0)
{
head = head->next;
n--;
}
return head;
}
};
注:moveHead函数参数中的&引用开始没有考虑到,不然不能改变head值。多亏师兄指正这个错误。