java数组实现栈先进后出操作demo

public class ArrayStackDemo {
    public static void main(String[] args) {
        ArrayStack stack = new ArrayStack(4);
        String key = "";
        boolean loop = true;//判断是否退出菜单
        Scanner scanner = new Scanner(System.in);

        while (loop){
            System.out.println("show: 表示显示栈");
            System.out.println("exit: 退出程序");
            System.out.println("push: 表示添加数据到栈(入栈)");
            System.out.println("pop: 表示从栈中取出数据（出栈）");
            System.out.println("请输入你的选择");
            key = scanner.next();
            if(key.equals("show")){
                stack.list();
            }else if(key.equals("push")){
                System.out.println("请输入一个数");
                int value = scanner.nextInt();
                stack.push(value);
            }else if(key.equals("pop")){
                try {
                    int res = stack.pop();
                    System.out.printf("出栈的数据是%d \n",res);
                }catch (Exception e){
                    System.out.println(e.getMessage());
                }
            }else if(key.equals("exit")){
                scanner.close();
                loop = false;
            }
        }
        System.out.println("程序退出");
    }
}

//定义一个ArrayStack表示栈
class ArrayStack{
    private int maxSize;//栈的大小
    private int[] stack;//数组，数组模拟栈，数据放在该数组
    private int top = -1;//top表示栈顶，初始化-1

    //构造器
    public ArrayStack(int maxSize){
        this.maxSize = maxSize;
        stack = new int[this.maxSize];
    }

    //栈满
    public boolean isFull(){
        return top == maxSize-1;
    }

    //栈空
    public boolean isEmpty(){
        return top == -1;
    }

    //入栈
    public void push(int value){
        //先判断栈是否满
        if(isFull()){
            System.out.println("栈满");
            return;
        }
        top++;
        stack[top] = value;
    }

    //出栈
    public int pop(){
        if(isEmpty()){
            throw new RuntimeException("栈空");
        }
        int value = stack[top];
        top --;
        return value;
    }

    //遍历栈,遍历时，需要从栈顶显示数据
    public void list(){
        if(isEmpty()){
            System.out.println("栈空，没有数据~");
            return;
        }
        for(int i=top;i>=0;i--){
            System.out.printf("stack[%d]=%d \n",i,stack[i]);
        }
    }
}