seqstack.java

来自「基本的数据结构的java代码」· Java 代码 · 共 50 行

public class SeqStack{
	
	final int defaultSize = 10;
	int top;
	Object[] stack;
	int maxStackSize;
	
	SeqStack(){
		initiate(defaultSize);
	}
	
	SeqStack(int sz){
		initiate(sz);
	}
	
	public void initiate(int sz){
		maxStackSize = sz;
		top = 0;
		stack = new Object[sz];
	}
	
	public void push(Object obj) throws Exception{
		if(top == maxStackSize){
			throw new Exception("堆栈已满！");
		}
		stack[top] = obj;
		top ++;
	}
	
	public Object pop() throws Exception{
		if(top == 0){
			throw new Exception("堆栈已空！");
		}
		top --;
		return stack[top];
	}
	
	public Object getTop() throws Exception{
		if(top == 0){
			throw new Exception("堆栈已空！");
		}
		return stack[top - 1];
	}
	
	public boolean isEmpty(){
		return (top != 0);
	}
}