Total Accepted: 72363
Total Submissions: 239177
Difficulty: Easy
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.
分析:
双指针法,指针pa、pb分别指向链表A和B的首节点。
遍历链表A,记录其长度lengthA,遍历链表B,记录其长度lengthB。
因为两个链表的长度可能不相同,比如题目所给的case,lengthA=5,lengthB=6,则作差得到lengthB-lengthA=1,将指针pb从链表B的首节点开始走1步,即指向了第二个节点,pa指向链表A首节点,然后它们同时走,每次都走一步,当它们相等时,就是交集的节点。
时间复杂度O(lengthA+lengthB),空间复杂度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==NULL||headB==NULL)
return NULL;
int lenA=0,lenB=0;
ListNode *tmpA=headA,*tmpB=headB;
ListNode *endA=headA,*endB=headB;
while(tmpA!=NULL){lenA++;endA=tmpA;tmpA=tmpA->next;}//计算链表a的长度
while(tmpB!=NULL){lenB++;endB=tmpB;tmpB=tmpB->next;}//计算链表b的长度
if(endA!=endB)
return NULL;
//平移较长的链表相应长度差
if(lenA<=lenB){
int n=lenB-lenA;
tmpA=headA;tmpB=headB;
while(n) {
tmpB=tmpB->next;
n--;
}
}else{
int n=lenA-lenB;
tmpA=headA;tmpB=headB;
while(n) {
tmpA=tmpA->next;
n--;
}
}
//寻找相同的节点指针
while(tmpA!=tmpB){
tmpA=tmpA->next;
tmpB=tmpB->next;
}
return tmpA;
}
};
注:本博文为EbowTang原创,后续可能继续更新本文。如果转载,请务必复制本条信息!
原文地址:http://blog.csdn.net/ebowtang/article/details/51292290
原作者博客:http://blog.csdn.net/ebowtang
本博客LeetCode题解索引:http://blog.csdn.net/ebowtang/article/details/50668895