160. Intersection of Two Linked Lists
来源:互联网 发布:做大数据需要什么语言 编辑:程序博客网 时间:2024/04/29 22:43
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那题,方法也是类似的双指针相遇法。分两步走:
1. 如何判断两链表是否相交?
两链表相交则他们必然有共同的尾节点。所以遍历两个链表,找到各自的尾节点,如果tailA!=tailB则一定不相交,反之则相交。
2. 如何判断两链表相交的起始节点?
在第1步判断相交时可以顺带计算两链表的长度lenA和lenB。让长的链表的head先走abs(lenA-lenB)步,然后和短链表的head一起走,直到两者相遇,即为要找的节点。
class Solution {public: ListNode *getIntersectionNode(ListNode *headA, ListNode *headB) { if(!headA || !headB) return NULL; int lenA = 0, lenB = 0; ListNode *tailA = headA, *tailB = headB; while(tailA->next) { tailA = tailA->next; lenA++; } while(tailB->next) { tailB = tailB->next; lenB++; } if(tailA!=tailB) return NULL; if(lenA>lenB) { for(int i=0; i<lenA-lenB; i++) headA = headA->next; } else { for(int i=0; i<lenB-lenA; i++) headB = headB->next; } while(headA!=headB) { headA = headA->next; headB = headB->next; } return headA; }};
0 0
- [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
- 160. Intersection of Two Linked Lists
- 160. Intersection of Two Linked Lists
- [LeetCode]160. Intersection of Two Linked Lists
- 160. Intersection of Two Linked Lists
- 160. Intersection of Two Linked Lists
- LeetCode--160. Intersection of Two Linked Lists
- 160. Intersection of Two Linked Lists
- LeetCode 160. Intersection of Two Linked Lists
- 160. Intersection of Two Linked Lists
- 160. Intersection of Two Linked Lists
- 160. Intersection of Two Linked Lists
- 【LeetCode】160. Intersection of Two Linked Lists
- 160. Intersection of Two Linked Lists
- 160. Intersection of Two Linked Lists
- 自定义一个可以嵌套在ScrollView中使用的ListView和GridView
- 自学 iOS 开发的一些经验
- JVM垃圾回收机制
- [搜索]hdu5355
- 程序架构过渡资料
- 160. Intersection of Two Linked Lists
- MFC之模态与非模态对话框的创建与销毁
- git环境搭建(一)——gitolite的安装和管理员建立
- Zookeeper Api(java)入门与应用
- 浩爷概率DP快速学习方案--让你从5秒真男人中脱颖而出-。-!
- JQuery中根据属性或属性值获得元素(6种情况获取方法)
- Java缓冲区之输入输出流
- VC为控件加ToolTip工具提示方法总结
- 使用博客的一些理由