栈(stack)这种数据结构用得相当那个广泛。用list实现相当方便。特点就是FILO(先进,后出)
public class MyStack {
private MyLinkedList lists;
public MyStack(){
lists=new MyLinkedList();
}
//将新元素压入栈中,位居栈顶
public void push(int num){
lists.addFirst(num);
}
//将栈顶元素弹出栈
public void pop(){
if(lists.size()==0)
throw new NullPointerException();
lists.deleteFirst();
}
//获取栈顶元素,并不删除
public int top(){
if(lists.size()==0)
throw new NullPointerException();
return lists.getFirst();
}
public boolean isEmpty(){
return lists.size()==0;
}