标签：
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:
null.
Credits:
Special thanks to @stellari for adding this problem and creating all test cases.
Linked List
/** * 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 == NULL || headB == NULL) return NULL; int lenA = 0; int lenB = 0; ListNode* pA = headA; ListNode* pB = headB; while(pA) { lenA ++; pA = pA->next; } while(pB) { lenB ++; pB = pB->next; } if(lenA > lenB) { for(int i = 0; i < (lenA-lenB); i++) headA = headA->next; } else if(lenA < lenB) { for(int i = 0; i < (lenB-lenA); i++) headB = headB->next; } while(headA != headB) { headA = headA->next; headB = headB->next; } if(headA == headB) return headA; else return NULL; } };
[LeetCode] Intersection of Two Linked Lists
标签：
原文地址：http://www.cnblogs.com/diegodu/p/4630620.html
