LeetCode(160) Intersection of Two Linked Lists
来源:互联网 发布:淘宝批量发货收费吗 编辑:程序博客网 时间:2024/05/13 20:03
题目如下:
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.
分析如下:
这道题目其实和之前的一道题目 Linked List Cycle II 一样,只需要把这道题目中的一条list的尾巴连接到另一条list的头部,就变成了Linked List Cycle II这道题目了。
我的代码:
- //288ms
- class Solution {
- public:
- ListNode *detectCycle(ListNode *head) {
- ListNode* fast = head;
- ListNode* slow = head;
- while (slow != NULL && fast != NULL) {
- slow = slow->next;
- fast = fast->next;
- if(fast != NULL)
- fast = fast->next;
- if (fast == slow)
- break;
- }
- if (fast == NULL) return NULL;
- slow = head;
- while (slow != fast) {
- slow = slow->next;
- fast = fast->next;
- }
- return fast;
- }
- ListNode *getIntersectionNode(ListNode *headA, ListNode *headB) {
- ListNode* keepHeadB = headB;
- ListNode* keepTailB = headB;
- if (headA == NULL || headB == NULL) return NULL;
- while (headB->next != NULL)
- headB = headB->next;
- keepTailB = headB;
- headB->next = headA;
- ListNode* cycleBegin = detectCycle(keepHeadB);
- keepTailB->next = NULL;
- return cycleBegin;
- }
- };
- leetcode 160-Intersection of Two Linked Lists
- leetcode 160: Intersection of Two Linked Lists
- LeetCode(160) Intersection of Two Linked Lists
- [leetcode 160] Intersection of Two Linked Lists
- leetCode #160 Intersection of Two Linked Lists
- LeetCode(160) Intersection of Two Linked Lists
- LeetCode[160]Intersection of Two Linked Lists
- [LeetCode 160]Intersection of Two Linked Lists
- [LeetCode][160][Intersection of Two Linked Lists ]
- leetcode-160 Intersection of Two Linked Lists
- leetcode 160Intersection of Two Linked Lists
- LeetCode 160 :Intersection of Two Linked Lists
- leetcode[160]:Intersection of Two Linked Lists
- leetcode-160-Intersection of Two Linked Lists
- [Leetcode 160] Intersection of Two Linked Lists
- leetcode 160: Intersection of Two Linked Lists
- [Leetcode]#160 Intersection of Two Linked Lists
- LeetCode 160 Intersection of Two Linked Lists
- poj3107 树的重心
- C#基础知识复习1代码规范-执行流程(c#)-面向对象-引用命名空间-封装-继承-访问修饰符-虚方法-静态成员-多态-抽象类等
- WinFrom Chart柱状图的使用
- Android - Toast字体修改
- nginx链表ngx_list_t
- LeetCode(160) Intersection of Two Linked Lists
- 学习编程的方法
- linux + postgresql + postgis 源码 安装
- 如何把ppt演示文档转成pdf文档
- IOS-为什么很多内置类如UITableViewController的delegate属性都是assign而不是retain的?
- Android学习:进程以及优先级
- 说说Android LRU缓存算法实现学习笔记(一)
- 777777777777777
- display:inline-block之用法