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.

只需要将listB首位相连，这样listA和listB就形成了一个带有环的链表。

这样题目就变成了Linked List Cycle II

 1 ListNode *getIntersectionNode(ListNode *headA, ListNode *headB)
 2     {
 3         ListNode *tail, *join;
 4         if (headA == NULL || headB == NULL)
 5             return NULL;
 6
 7         for (tail = headB; tail->next != NULL; tail = tail->next); // reach tail
 8         tail->next = headB; // create a circle
 9         join = detectCycle(headA);
10         tail->next = NULL; // keep list B as original
11
12         return join;
13     }
14
15     ListNode *detectCycle(ListNode *head)
16     {
17         ListNode *fast = head, *slow = head;
18
19         while (fast != NULL)
20         {
21             slow = slow->next;
22             fast = fast->next;
23             if (fast != NULL)
24                 fast = fast->next;
25             if (fast != NULL && fast == slow) // catch slow
26                 break;
27         }
28
29         if (fast == NULL)
30             return NULL;
31
32         slow = head;
33         while (slow != fast)
34         {
35             slow = slow->next;
36             fast = fast->next;
37         }
38         return slow;
39     }

转载于:https://www.cnblogs.com/ym65536/p/4141555.html

leetcode. Intersection of Two Linked Lists相关推荐

[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 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 : 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:Intersection of Two Linked Lists
题目大意:找两个链表的第一个交点. 这里先给出一些链表相交基础的说明: 对于链表X,用X[i]表示链表X的第i个元素,L(X)表示X的长度. 性质1:如果X[i]等于Y[j],那么可以推出X[i+1] ...
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 ...
C#LeetCode刷题之#160-相交链表（Intersection of Two Linked Lists）
问题该文章的最新版本已迁移至个人博客[比特飞],单击链接 https://www.byteflying.com/archives/3824 访问. 编写一个程序,找到两个单链表相交的起始节点. 例如 ...
leetcode python3 简单题160. Intersection of Two Linked Lists
1.编辑器我使用的是win10+vscode+leetcode+python3 环境配置参见我的博客: 链接 2.第一百六十题 (1)题目英文: Write a program to find t ...
【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. Intersection of Two Linked Lists

leetcode. Intersection of Two Linked Lists相关推荐

最新文章

热门文章