堆栈最好用链表实现
/**
* Created by yywang on 2017/1/16.
*/
public class Stack<Item> {
private Node first;//栈顶
private int N;//元素数量
private class Node{
Item item;
Node next;
}
public boolean isEmpty() {return N==0;}
public int size(){return N;}
public void push(Item item){
Node oldfirst = first;
first = new Node();
first.item = item;
first.next = oldfirst;
N++;
}
public Item pop(){
Item item = first.item;
first = first.next;
N--;
return item;
}
//itetator()
}