栈、前缀prefix、中缀infix、后缀suffix表达式

package com.shizhong.stack;

import java.util.Scanner;

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();
            switch (key){
   
                case "show":
                    stack.list();
                    break;
                case "push":
                    System.out.println("请输入一个数");
                    int value = scanner.nextInt();
                    stack.push(value);
                    break;
                case "pop":
                    try {
   
                        int res = stack.pop();
                        System.out.printf("出栈数据为%d\n",res);
                    }catch (Exception e){
   
                        System.out.println(e.getMessage());
                    }
                    break;
                case "exit":
                    scanner.close();
                    loop = false;
                    break;
                default:
                    break;
            }
        }
        System.out.println("程序退出");

    }
}
class ArrayStack {
   
    private int maxSize;//栈的大小
    private int[] stack;//数组模拟栈，数据放在该栈中
    private int top = -1;//定义栈顶初始化为-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()