数组模拟栈

class Stack{
    private int maxsize;//栈的大小
    private int [] stack;//数组模拟栈
    private int top = -1;
    public Stack(int maxsize){
        this.maxsize = maxsize;
        stack = new int[maxsize];
    }
    public boolean isFull(){
        return top == maxsize - 1;
    }
    public boolean isEmpty(){
        return top == -1;
    }
    public void push(int value){
        if(isFull()){
            System.out.println("栈满");
        }
        top++;
        stack[top] = value;
    }
    public int pop(){
        if(isEmpty()){
            System.out.println("空栈");
        }
        int temp = stack[top];
        top--;
        return temp;
    }
    public void show(){
        if(isEmpty()){
            System.out.println("栈空");
        }
        for(int i = top; i >= 0;i--){
            System.out.println(stack[i]);
        }
    }