leetcode Intersection of Two Linked Lists My Submissions Question Solution Total Accepted: 43555 To

Intersection of Two Linked Lists

My Submissions

Question  Solution 

Total Accepted: 43555  Total Submissions: 149194  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.

特别注意此处，相等节点前面的节点数是不一定相等的。而从相等节点开始到结尾都是相等的。所以两个长度为m,n的链表，那么相同的链表的长度一定小于min(m,n),所以可以将较长的那个的指针往后移动abs(m-n)，然后开始判断共同节点。

// test160IntersectionofTwoLinkedLists.cpp : 定义控制台应用程序的入口点。
//


#include "stdafx.h"


struct ListNode {
int val;
ListNode *next;
ListNode(int x) : val(x), next(NULL) {}
};
ListNode *getIntersectionNode(ListNode *headA, ListNode *headB);
int _tmain(int argc, _TCHAR* argv[])
{
ListNode *p1, *p2;
p1 = new ListNode(0);
p2 = new ListNode(0);


p1->val =2;
p2->val = 3;
p1->next = p2;
p2->next = NULL;


ListNode *s = getIntersectionNode(p1, p2);
return 0;
}


ListNode *getIntersectionNode(ListNode *headA, ListNode *headB) 
{
if (headA == NULL && headB == NULL)
return NULL;
if (headA == NULL || headB == NULL)
return  NULL;
if (headA == headB)
return headA;
int counta = 1, countb = 1;
ListNode *temp1 = headA;
ListNode *temp2 = headB;
while (temp1->next!=NULL)
{
temp1 = temp1->next;
counta++;
}
while (temp2->next!=NULL)
{
temp2 = temp2->next;
countb++;
}
if (temp1 != temp2)
return NULL;
temp1 = headA;
temp2 = headB;
if (counta > countb)
{
for (int i = 0; i < counta - countb; i++)
temp1 = temp1->next;


}
if (counta < countb)
for (int j = 0; j < countb - counta; j++)
temp2 = temp2->next;
if (temp1 == temp2)
return temp1;
while (temp1->next != NULL && temp2->next != NULL)
{
if (temp1->next == temp2->next)
return temp1->next;
temp1 = temp1->next;
temp2 = temp2->next;
}
return NULL;
}