两个单链表(可能有环)是否相交，若相交则返回第一个相交点

/**
 * Created by lxw, liwei4939@126.com on 2017/10/27.
 * 两个单链表是否相交，若相交则返回第一个相交点(单链表可能有环)
 */
public class IntersectNode {

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

    //判断链表是否有环，若有环则返回第一个入环点
    public Node getLoopNode(Node head){
        if(head == null || head.next == null || head.next.next == null)
            return null;
        Node n1 = head.next;
        Node n2 = head.next.next;
        while (n1 != n2){
            if(n2.next == null || n2.next.next == null)
                return null;
            n1 = n1.next;
            n2 = n2.next.next;
        }
        n2 = head;
        while (n1 != n2){
            n1 = n1.next;
            n2 = n2.next;
        }
        return n1;
    }

    //判断两个无环链表是否相交，若相交返回第一个相交节点
    public 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 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;
    }

    public 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;
    }
}