## 两个单链表相交的一系列问题

package chj;

public class Problem_11_FindFirstIntersectNode {

public static class Node {
public int value;
public Node next;

public Node(int data) {
this.value = data;
}
}

return null;
}
if (loop1 == null && loop2 == null) {
}
if (loop1 != null && loop2 != null) {
}
return null;
}

public static Node getLoopNode(Node head) {
return null;
}
Node n1 = head.next; // n1 -> slow
Node n2 = head.next.next; // n2 -> fast
while (n1 != n2) {
if (n2.next == null || n2.next.next == null) {
return null;
}
n2 = n2.next.next;
n1 = n1.next;
}
while (n1 != n2) {
n1 = n1.next;
n2 = n2.next;
}
return n1;  //再次相交时(n1==n2),第一个入环的节点返回
}

return null;
}
int n = 0;
while (cur1.next != null) {
n++;
cur1 = cur1.next;
//System.out.println("n===="+n);
//System.out.println("cur1.value="+cur1.value);
}
System.out.println("链表1遍历完时，cur1指针对应的value值:"+cur1.value);
while (cur2.next != null) {
n--;
cur2 = cur2.next;
//System.out.println("n===="+n);
//System.out.println("cur2.value="+cur2.value);
}
System.out.println("链表2遍历完时，cur2指针对应的value值:"+cur2.value);

if (cur1 != cur2) {
return null;
}
//System.out.println("n的值 = "+n);
n = Math.abs(n);
while (n != 0) {
n--;
cur1 = cur1.next;
}
while (cur1 != cur2) {
cur1 = cur1.next;
cur2 = cur2.next;
}
return cur1;
}

public static Node bothLoop(Node head1, Node loop1, Node head2, Node loop2) {
Node cur1 = null;
Node cur2 = null;
if (loop1 == loop2) {
int n = 0;
while (cur1 != loop1) {
n++;
cur1 = cur1.next;
}
System.out.println("链表1遍历完 时,cur1指针对应的value值:"+cur1.value);
while (cur2 != loop2) {
n--;
cur2 = cur2.next;
}
n = Math.abs(n);
while (n != 0) {
n--;
cur1 = cur1.next;
}
while (cur1 != cur2) {
cur1 = cur1.next;
cur2 = cur2.next;
}
return cur1;
} else {
cur1 = loop1.next;
while (cur1 != loop1) {
if (cur1 == loop2) {
return loop1;
}
cur1 = cur1.next;
}
return null;
}
}

public static void main(String[] args) {
// 1->2->3->4->5->6->8->12->null

// 0->9->8->6->7->null
System.out.println("==========分割线==========");

//
//

}

}


链表1遍历完时，cur1指针对应的value值:12

Common IntersectNode: 6
==========分割线==========