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.
public ListNode getIntersectionNode(ListNode headA, ListNode headB) {
ListNode a= headA, b=headB;
if(headA==null||headB==null) return null;
while(a!=b){
a = a==null?headB:a.next;
b = b==null?headA:b.next;
}
return a;
}
总结:简直太聪明了!两次迭代,第一次a,b分别到另外一个linked list的head, 然后不论长度如何,同时到达intersection node.