从单链表中删除最后一个节点(java)

Question

公共类LinkedList11{//私有内部类节点

private class Node{
    int data;
    Node link;


    public Node(){
        data = Integer.MIN_VALUE;
        link = null;
    }

    public Node(int x, Node p){
        data = x;
        link = p;
    }
}
// End of Node class

public Node head;

public LinkedList11(){
    head = null;
}

public int deleteLast() throws NoSuchElementException {


    if ( head == null )   //handle when list is empty
    { throw new NoSuchElementException();}

     if(head.link == null)  //handle when head is the only node
     { return head.data;


        }

        Node position = head;
        Node temp = head;   //temp has to be initialized to something 
        int dataAtEnd =0;
        while (position != null)
        {   dataAtEnd = position.data;    
            temp =position;               //safe keep current position
           position = position.link;     //update position pointer to get the next value  
          }

       position =temp;  // store current position in next position
       return dataAtEnd;

}

}

Answer 1

首先，如果head是唯一的节点，并且要删除它，则需要将head设置为null。

if(head.link == null) {
    int result = head .data;
    head = null;
    return result;
}

在检查head是否是唯一的节点后，尝试如下所示：

Node current = head;
while (current.link.link != null)
    current = current.link;
int result = current.link.data;
current.link = null;
return result;

您需要查看前面的步骤，以检查下一个节点是否是最后一个节点，并从最后一个节点之前的节点中删除最后一个节点。我希望你明白，我的意思，为错别字道歉