Intersection of Two Linked Lists(LIST-2 POINTER)
2015-01-16 21:52
288 查看
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.
FIRST TRY
Result: Accepted
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.
FIRST TRY
/** * Definition for singly-linked list. * struct ListNode { * int val; * ListNode *next; * ListNode(int x) : val(x), next(NULL) {} * }; */ class Solution { public: ListNode *getIntersectionNode(ListNode *headA, ListNode *headB) { if(!headA || !headB) return NULL; int lenA = 0; int lenB = 0; ListNode* pA = headA; ListNode* pB = headB; while(pA->next) { lenA++; pA = pA->next; } while(pB->next) { lenB++; pB = pB->next; } if(pA == pB) { pA = headA; pB = headB; if(lenA > lenB) { lenA -= lenB; while(lenA-- > 0) pA = pA->next; } else if(lenA < lenB) { lenB -= lenA; while(lenB-- > 0) pB = pB->next; } while(pA!=pB) { pA = pA->next; pB = pB->next; } return pA; } else return NULL; } };
Result: Accepted
相关文章推荐
- Data Structure Linked List: Write a function to get the intersection point of two Linked Lists.
- linked-list-cycle&&find-peak-element&&intersection-of-two-linked-lists
- LeetCode[Linked List]: Intersection of Two Linked Lists
- (LinkedList)Intersection of Two Linked Lists
- (**leetcode_LinkedList) Intersection of Two Linked Lists
- LinkedList-160-Intersection of Two Linked Lists
- [leetcode][list] Intersection of Two Linked Lists
- Insertion Sort List && Remove Duplicates from Sorted List II && Intersection of Two Linked Lists
- [Linked List]Intersection of Two Linked Lists
- Intersection of Two Linked Lists
- LeetCode: Intersection of Two Linked Lists
- [C语言][LeetCode][160]Intersection of Two Linked Lists
- 【LeetCode】160 - Intersection of Two Linked Lists
- leetcode-- Intersection of Two Linked Lists -- 重点
- leetcode 160 Intersection of Two Linked Lists
- leetcode: Intersection of Two Linked Lists
- Intersection of Two Linked Lists
- Leetcode: Intersection of Two Linked Lists
- Intersection of Two Linked Lists
- Intersection of Two Linked Lists