【LeetCode從零單排】No.160 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.
Credits:
Special thanks to @stellari for adding this problem and creating all test cases.
題目要求取兩個連結串列的交點,而且時間複雜度必須是O(n),所以就不能用巢狀迴圈的方法。用瞭如下方法,先計算兩個連結串列的各自長度,將長連結串列節點向下移動兩連結串列長度差,再計算。
程式碼
/**
* Definition for singly-linked list.
* public class ListNode {
* int val;
* ListNode next;
* ListNode(int x) {
* val = x;
* next = null;
* }
* }
*/
public class Solution {
public ListNode getIntersectionNode(ListNode headA, ListNode headB) {
if(headA==null || headB==null) return null;
int Aindex_length=getLength(headA);
int Bindex_length=getLength(headB);
int dis=Math.abs(Aindex_length-Bindex_length);
ListNode Aindex=headA;
ListNode Bindex=headB;
if(Aindex_length>=Bindex_length){
for(int i=0;i<dis;i++){
Aindex=Aindex.next;
}
while(Bindex!=null){
if(Aindex.val==Bindex.val){return Aindex;}
else{
Aindex=Aindex.next;
Bindex=Bindex.next;
}
}
}
Aindex=headA;
Bindex=headB;
if(Aindex_length<Bindex_length){
for(int i=0;i<dis;i++){
Bindex=Bindex.next;
}
while(Aindex!=null){
if(Aindex.val==Bindex.val){return Aindex;}
else{
Aindex=Aindex.next;
Bindex=Bindex.next;
}
}
}
return null;
}
public int getLength(ListNode head){
ListNode index=head;
int length=1;
while(index.next!=null){
index=index.next;
length++;
}
return length;
}
}
/********************************
* 本文來自部落格 “李博Garvin“
* 轉載請標明出處:http://blog.csdn.net/buptgshengod
******************************************/
相關文章
- Leetcode 160. Intersection of Two Linked ListsLeetCode
- LeetCode | 349 Intersection Of Two ArraysLeetCode
- Leetcode 21 Merge Two Sorted ListsLeetCode
- leetcode 350. Intersection of Two Arrays IILeetCode
- LeetCode 21. Merge Two Sorted ListsLeetCode
- LeetCode Merge Two Sorted Lists(021)解法總結LeetCode
- Mysql從零單排-1MySql
- 資料結構與演算法 | Leetcode 21:Merge Two Sorted Lists資料結構演算法LeetCode
- 從零單排學Redis【黃金】Redis
- 從零單排學Redis【白銀】Redis
- LeetCode #1:Two Sum(簡單題)LeetCode
- 從零單排學Redis【鉑金一】Redis
- 從零單排學Redis【鉑金二】Redis
- SpringBoot從零單排 ------初級入門篇Spring Boot
- 【3y】從零單排學Redis【青銅】Redis
- Leetcode 23 Merge k Sorted ListsLeetCode
- LeetCode | 141 linked list cycleLeetCode
- 「從零單排canal 03」 canal原始碼分析大綱原始碼
- 「從零單排canal 05」 server模組原始碼解析Server原始碼
- 「從零單排canal 07」 parser模組原始碼解析原始碼
- 從零單排,使用 Netty 構建 IM 聊天室~Netty
- 「從零單排canal 06」 instance模組原始碼解析原始碼
- Laravel 從零單排系列教程 01 :Homestead 環境搭建Laravel
- 【Leetcode】23. Merge k Sorted ListsLeetCode
- Leetcode 231 Power of TwoLeetCode
- Leetcode 1 two sumLeetCode
- LeetCode | 1 Two SumLeetCode
- 三分鐘從零單排js靜態檢查JS
- Spring AOP從零單排-織入時期原始碼分析Spring原始碼
- [leetcode]linked-list-cycle-iiLeetCode
- Leetcode 206. Reverse Linked ListLeetCode
- Leetcode 234. Palindrome Linked ListLeetCode
- LeetCode 382 Linked List Random NodeLeetCoderandom
- Leetcode 29 Divide Two IntegersLeetCodeIDE
- LeetCode 2 Add Two NumbersLeetCode
- LeetCode-1 Two SumLeetCode
- [LeetCode]1.Two SumLeetCode
- Leetcode 231. Power of TwoLeetCode
- python: leetcode - 1 Two SumPythonLeetCode