class Node<E>{
E data;
Node<E> next = null;
public Node(E data){
this.data = data;
}
}
public class ListStack<E>{
Node<E> top = null;
public boolean empty(){
return top == null;
}
//头插法插入新节点,实现入栈
public void push(E data){
Node<E> newNode = new Node<E>(data);
newNode.next = top;
top = newNode;
}
public E pop(){
if(this.empty()){
return null;
}
E data = top.data;
top = top.next;
return data;
}
public E peek(){
if(empty())
return null;
return top.data;
}
}
Java数据结构之——栈:用链表实现
猜你喜欢
转载自blog.csdn.net/qq_26552071/article/details/86300461
今日推荐
周排行