【leetcode】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.

 1 class Solution {
 2 public:
 3     ListNode *getIntersectionNode(ListNode *headA, ListNode *headB) {
 4         if(headA==NULL||headB==NULL) return NULL;
 5
 6         int lenA=1;
 7         ListNode * curA=headA;
 8         while(curA->next)
 9         {
10             lenA++;
11             curA=curA->next;
12         }
13
14         int lenB=1;
15         ListNode * curB=headB;
16         while(curB->next)
17         {
18             lenB++;
19             curB=curB->next;
20         }
21
22         if(curA!=curB)
23             return NULL;
24         else
25         {
26             int diff=lenA-lenB;
27             if(diff>0)
28             {
29                 while(diff)
30                 {
31                     headA=headA->next;
32                     diff--;
33                 }
34             }
35             else
36             {
37                 while(diff)
38                 {
39                     headB=headB->next;
40                     diff++;
41                 }
42             }
43
44             while(1)
45             {
46                 if(headA==headB)
47                     return headA;
48                 else
49                 {
50                     headA=headA->next;
51                     headB=headB->next;
52                 }
53             }
54         }
55     }
56 };

转载于:https://www.cnblogs.com/jawiezhu/p/4504231.html

【leetcode】Intersection of Two Linked Lists相关推荐

LeetCode(160): Intersection of Two Linked Lists
Intersection of Two Linked Lists: Write a program to find the node at which the intersection of two ...
[LeetCode]--160. Intersection of Two Linked Lists
Write a program to find the node at which the intersection of two singly linked lists begins. For ex ...
[Leetcode]160. Intersection of Two Linked Lists
Write a program to find the node at which the intersection of two singly linked lists begins. For ex ...
LeetCode 160. Intersection of Two Linked Lists
题目: Write a program to find the node at which the intersection of two singly linked lists begins. Fo ...
【LeetCode】328. Odd Even Linked List 解题报告（Python C++）
作者: 负雪明烛 id: fuxuemingzhu 个人博客: http://fuxuemingzhu.cn/ 目录题目描述题目大意解题方法日期题目地址:https://leetcode.c ...
【leetcode】86. Partition List
题目如下: Given a linked list and a value x, partition it such that all nodes less than x come before no ...
[LeetCode] Intersection of Two Linked Lists 求两个链表的交点
Write a program to find the node at which the intersection of two singly linked lists begins. For ex ...
【leetcode】109. Convert Sorted List to Binary Search Tree
题目如下: Given a singly linked list where elements are sorted in ascending order, convert it to a heigh ...
【LeetCode】【HOT】23. 合并K个升序链表（递归+分治）
[LeetCode][HOT]23. 合并K个升序链表文章目录 [LeetCode][HOT]23. 合并K个升序链表 package hot;import java.util.Arrays;cla ...

【leetcode】Intersection of Two Linked Lists

【leetcode】Intersection of Two Linked Lists相关推荐

最新文章

热门文章