第八周作业 - 命题作业

//判断链表是否合并
boolean hasMergeNode(Node linkNode1,Node linkNode2){
    Node node1 = linkNode1;
    Node node2 = linkNode2;
    while(node1.next() != null){
        node1 = node1.next();
    }
    while(node2.next() != null){
        node2 = node2.next();
    }
    if(node1 == node2){
        return true;
    }
    return false;
}

//找到两个链表中合并的元素
Node getMergeNode(Node linkNode1,Node linkNode2){
    Node node1 = linkNode1;
    Node node2 = linkNode2;
    
    int lenght1 = 0;
    int length2 = 0;
    while(node1.next() != null){
        node1 = node1.next();
        lenght1++;
    }
    while(node2.next() != null){
        node2 = node2.next();
        length2++;
    }
    
    if(lenght1 > lenght2){
        node1 = linkNode1;
        node2 = linkNode2;
        
    }else{
       node1 = linkNode2;
       node2 = linkNode1;
    }
    
    int lenght = abs(lenght1 - lenght2);
    for(int i = 0; i < lenght; i++){
        node1 = node1.next();
    }
    while(node1 != node2){
       node1 = node1.next();
       node2 = node2.next();
    }
    return node1;
}