java使用链表来模拟栈的入栈出栈操作实例代码

public class Entry {
private T value;
private Entry next;
public Entry() {
  this(null);
}
public Entry(T value) {
  this.value=value;
  this.next=null;
}
  
public void setValue(T value) {
  this.value=value;
}

public void setNext(Entry next) {
  this.next=next;
}

public T getValue() {
  return value;
}

public Entry getNext(){
  return next;
}

}

public class Link {//链表实现栈,先进后出
private Entry headEntry;
private int size=0;
public Link() {
  headEntry =new Entry<>();
}
public void pop() {//出栈
  if(headEntry.getNext()!=null) {
  headEntry.getNext().setValue(null);
  headEntry.setNext(headEntry.getNext().getNext());
  size--;
  }else {
    return;
  }
  
}
public void push(T value) {//入栈
  Entry newEntry=new Entry<>(value);
  if(headEntry.getNext()!=null) {
    newEntry.setNext(headEntry.getNext());
    
  }
    headEntry.setNext(newEntry);
    size++;
  
}


public void show(){//打印节点
  if(headEntry.getNext()==null) {
    return;
  }
  for(Entry p = headEntry.getNext();p!=null;p=p.getNext()){
    System.out.print(p.getValue()+" ");
  }
  System.out.println();
}
}

public class Main {
public static void main(String args[]) {
  Link ll=new Link<>();
  ll.push("1");//入栈
  ll.push("2");
  ll.push("3");
  ll.push("4");
  ll.push("5");
  ll.push("6");
  ll.push("7");
  ll.push("8");
  ll.show();//打印栈内元素
  ll.pop();//弹出栈顶元素
  ll.show();
  ll.pop();
  ll.show();
}
}