第八周作业

public class Node {
 
    private int data;
    private Node next;
 
    public int getData() {
        return data;
    }
 
    public void setData(int data) {
        this.data = data;
    }
 
    public Node getNext() {
        return next;
    }
 
    public void setNext(Node next) {
        this.next = next;
    }
 
    public Node(int data) {
        this.data = data;
    }
     
}

public static Node getFirstJoinNode(Node h1,Node h2) {
        int length1 = 0;
        int length2 = 0;
        Node node1 = h1;
        Node node2 = h2;
        while(null != node1.getNext()) {
            length1 ++;
            node1 = node1.getNext();
        }
        while(null != node2.getNext()) {
            length1 ++;
            node2 = node2.getNext();
        }
        if(length1 > length2){
            int count = length2 - length1;
            while(count > 0){
                h2 = h2.getNext();
                count-- ;
            }
        }else{
            int count = length1 - length2;
            while(count > 0){
                h1 = h1.getNext();
                count-- ;
            }
        }
        while (h1 != h2) {
            h1 = h1.getNext();
            h2 = h2.getNext();
        }
        return h1 == h2 ? h1 : null;
    }