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.
逻辑要清晰,
求绝对值: Math.abs(a-b)
/**
* 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;
ListNode a = headA;
ListNode b = headB;
int count1 = 1,count2 = 1;
while(a.next != null){
count1++;
a = a.next;
}
while(b.next != null){
count2++;
b = b.next;
}
if (a != b)
return null;
else{
int count = Math.abs(count1 - count2);
if(count1 > count2){
while(count > 0){
headA = headA.next;
count--;
}
}
else{
while(count > 0){
headB = headB.next;
count--;
}
}
while(headA != null && headB != null && headA != headB){
headA = headA.next;
headB = headB.next;
}
return headA;
}
}
}
http://blog.csdn.net/litoupu/article/details/41555557 侵删!!
public class Solution {
public ListNode getIntersectionNode(ListNode headA, ListNode headB) {
if(headA == null ||headB == null)return null;
ListNode h1 = headA;
ListNode h2 = headB;
int count1 = 1, count2 = 1;
while(h1.next != null){
count1++;
h1 = h1.next;
}
while(h2.next != null){
count2++;
h2 = h2.next;
}
if(h1 != h2) return null;
else{
int count = Math.abs(count1 - count2);
if(count2 > count1){
h1 = headB;
h2 = headA;
}
else{
h1 = headA;
h2 = headB;
}
while((count--) > 0){
h1 = h1.next;
}
while(h1 != null&&h2 != null && h1 != h2){
h1 = h1.next;
h2 = h2.next;
}
return h1;
}
}
}