栈

类

public class StackX {
	private long[] stackArray;
	private int maxSize;
	private int top;
	public StackX(int s){
		maxSize=s;
		stackArray=new long[maxSize];
		top=-1;
	}
	//添加数据
	public void push(long j){
		stackArray[++top]=j;
	}
	//查看并删除
	public long pop(){
		return stackArray[top--];
	}
	//查看
	public long peek(){
		return stackArray[top];
	}
	public boolean isEmpty(){
		return top==-1;
	}
	public boolean isFull(){
		return top==maxSize-1;
	}
}

主程序

public class StackAapp {
	public static void main(String[] args){
		StackX theStack=new StackX(10);
		theStack.push(20);
		theStack.push(40);
		theStack.push(60);
		theStack.push(80);
		while(!theStack.isEmpty()){
			long value=theStack.pop();
			System.out.print(value+" ");
		}
		System.out.println();
		if(!theStack.isFull()) theStack.push(1);
		if(!theStack.isFull()) theStack.push(2);
		if(!theStack.isFull()) theStack.push(3);
		if(!theStack.isFull()) theStack.push(4);
		if(!theStack.isFull()) theStack.push(1);
		if(!theStack.isFull()) theStack.push(1);
		if(!theStack.isFull()) theStack.push(1);
		System.out.println("theStack.isEmpty="+theStack.isEmpty());
		while(!theStack.isEmpty()){
			long value=theStack.pop();
			System.out.print(value+" ");
		}
	}
}