java - 在不使用迭代器的情况下更新到 LIST ADT 的下一个头部

Question

我如何在不使用 next 的情况下更新到新的头节点？

private E head;
private someList<E> tail;

public E removeHead(){
        this.tail = this.tail.getTail();  
        return this.head;
    }

Answer 1

我想这就是你想要的？

public E removeHead(){
    E oldhead = this.getHead();  // keep old head, so we can return it
    this.head = this.getTail().getHead(); // new head: comes out of old tail
    this.tail = this.getTail().getTail(); // new tail: remainder of old tail
    return oldhead;
}

public getHead(){ return head;}

public getTail(){ return tail;}

我想你已经实现了getTail？？