package Stack;

public class StackApp {
	public static void main(String[] args) {
		StackX stack = new StackX(10);
		long i = 10;
		
		while(!stack.isFull()) {
			stack.push(i);
			i++;
		}
		
		while(!stack.isEmpty()) {
			long value = stack.pop();
			System.out.println(value+" ");
		}
	}
}

class StackX implements StackInterface{
	private long[] a;
	private int maxsize;
	private int top;
	
	public StackX(int s) {
		this.maxsize = s;
		this.a = new long[this.maxsize];
		this.top = -1;
	}
	
	//入栈
	public void push(long value) {
		this.a[++this.top] = value;
	}
	
	//出栈
	public long pop() {
		return this.a[this.top--];
	}
	
	//查看
	public long peek() {
		return this.a[this.top];
	}
	
	//是否为空
	public boolean isEmpty() {
		return (this.top == -1);
	}
	
	//是否已满
	public boolean isFull() {
		return (this.top == this.maxsize-1);
	}
}