链表相交问题

题目：两条单向链表，不确定是否是有环还是无环，求两条链表是否相交，如果相交，则返回相交的节点，否则返回NULL

思路：有环无环可以通过快慢指针判断，如果有环，需要返回入环的节点。假设链表1的头部为head1，入环节点为loop1，链表2的头部为head2，入环节点为loop2。

1. 如果是都是无环链表，则问题转化为两条单链表的相交问题：先遍历head1，获取链表1的长度n1，以及链表1的最后一个节点tailA，再去遍历head2，获取链表2的长度n2，以及链表2的最后一个节点tailB。如果tailA==tailB，链表才可能会相交，在此情况下，让长的链表先走Math.abs(n1-n2)步。然后两个链表同时出发，碰到第一个相等的节点就是两条链表相交的节点。
2. 如果一条链表有环，一条链表无环，则不可能相交。
3. 如果两个都有环。分三种情况： ( 3.1 )loop1==loop2，则两条链表的入环节点一样，即两条链表在入环之前，就已经相交的了，问题转化为1的情况，只不过需要假设两条链表的尾结点都是loop1。    ( 3.2 ) loop1!=loop2。即两条链表的入环节点不一样，两条链表可能各自成环不相互交，也可能两条链表相交，此时的相交节点为loop1或loop2【像TV电视猫的形状 】。

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

	public static Node getIntersectNode(Node head1, Node head2) {
		if (head1 == null || head2 == null) {
			return null;
		}
		Node loop1 = getLoopNode(head1);
		Node loop2 = getLoopNode(head2);
		if (loop1 == null && loop2 == null) {
			return noLoop(head1, head2);
		}
		if (loop1 != null && loop2 != null) {
			return bothLoop(head1, loop1, head2, loop2);
		}
		return null;
	}

	public static Node getLoopNode(Node head) {
		if (head == null || head.next == null || head.next.next == null) {
			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;
		}
		n2 = head; // n2 -> walk again from head
		while (n1 != n2) {
			n1 = n1.next;
			n2 = n2.next;
		}
		return n1;
	}

	public static Node noLoop(Node head1, Node head2) {
		if (head1 == null || head2 == null) {
			return null;
		}
		Node cur1 = head1;
		Node cur2 = head2;
		int n = 0;
		while (cur1.next != null) {
			n++;
			cur1 = cur1.next;
		}
		while (cur2.next != null) {
			n--;
			cur2 = cur2.next;
		}
		if (cur1 != cur2) {
			return null;
		}
		cur1 = n > 0 ? head1 : head2;
		cur2 = cur1 == head1 ? head2 : head1;
		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) {
			cur1 = head1;
			cur2 = head2;
			int n = 0;
			while (cur1 != loop1) {
				n++;
				cur1 = cur1.next;
			}
			while (cur2 != loop2) {
				n--;
				cur2 = cur2.next;
			}
			cur1 = n > 0 ? head1 : head2;
			cur2 = cur1 == head1 ? head2 : head1;
			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;
		}
	}