public class Stacks {
    public int maxSize;
    public int top ;
    public int[] stack;
    //構(gòu)造器，傳入棧的最大容量
    public Stacks(int maxSize) {
        this.maxSize = maxSize;
        //初始化棧頂?shù)奈恢脼?1，?？?
        top = -1;
        //初始化數(shù)組，最大容量為棧的容量
        stack = new int[maxSize];
    }
}

    //因?yàn)榈讓邮菙?shù)組存儲(chǔ)數(shù)據(jù)，所以索引從0開始，
    //判斷條件為 top == maxSize - 1
    public boolean isFull(){
        return top == maxSize - 1;
    }

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

    public void push(int data){
        //判斷是否棧滿
        if (isFull()){
            System.out.println("棧滿，無(wú)法入棧");
            return;
        }
        top++;
        stack[top] = data;
    }

    public int pop(){
        if (isEmpty()){
            throw new RuntimeException("棧空，無(wú)法出棧！");
        }
        //先出棧，后減減
        return stack[top--];
    }

  public void show(){
        if (isEmpty()){
            System.out.println("?？?，無(wú)法顯示！");
            return;
        }
        for (int i = top ; i >= 0; i--){
            System.out.printf("stack[%d] = %d\n", i , stack[i]);
        }
    }

    public static List<String> endList(String s){
        String[] s1 = s.split("");
        List<String> stringList = new ArrayList<>();
        for (String s2 : s1) {
            stringList.add(s2);
        }
        return stringList;
    }

  public static int Calcu(String s){
        char ch = s.charAt(0);
        if (ch == '-' || ch == '+'){
            return 0;
        } else if (ch == '*' || ch == '/') {
            return 1;
        }
        return -1;
    }

public static List<String> MiddleToEndExpress(List<String> strings){
        //創(chuàng)建棧，存放運(yùn)算符
        Stack<String> operStack = new Stack<>();
        //因?yàn)檫@個(gè)棧不需要出棧，所以使用集合
        List<String> sumList = new ArrayList<>();
        for (String s : strings) {
            //判斷是否是數(shù)據(jù)
            if (s.matches("\\d+")){
               sumList.add(s);//是數(shù)據(jù)直接加入
            }else if (s.equals("(")){//判斷是否是左括號(hào)
                operStack.push(s);//是，直接放入符號(hào)棧
            }else if (s.equals(")")){//判斷是否是右括號(hào)
                while (!operStack.peek().equals("(")){//如果棧頂是左括號(hào)，退出循環(huán)
                    sumList.add(operStack.pop());//不是左括號(hào)，就將棧頂?shù)姆?hào)依次放入集合
                }
                //循環(huán)結(jié)束，表示棧頂是左括號(hào)，把左括號(hào)去掉，就去掉了一對(duì)括號(hào)
                operStack.pop();
            }else {//前面的判斷都不是，那就是運(yùn)算符
               //如果符號(hào)棧為空，并且運(yùn)算符小于等于棧頂?shù)倪\(yùn)算符優(yōu)先級(jí)
                while (operStack.size() != 0 && Calcu(s) <= Calcu(operStack.peek())){
                    //就將棧頂?shù)倪\(yùn)算符放入集合中
                    sumList.add(operStack.pop());
                }
                //然后將符號(hào)放入符號(hào)棧中
                operStack.push(s);
            }
        }
        //遍歷結(jié)束，將符號(hào)棧剩余的符號(hào)依次取出放入集合中
        while (operStack.size() != 0){
            sumList.add(operStack.pop());
        }
        //最后將集合返回
        return sumList;
    }

public static int endCalculator(List<String> stringList){
        //創(chuàng)建棧，存放數(shù)據(jù)
        Stack<String> dataStack = new Stack<>();
        //循環(huán)遍歷集合
        for (String s : stringList) {
            //正則表達(dá)式判斷是否是數(shù)據(jù)，如果是，就放入棧中
            if (s.matches("\\d+")){
                dataStack.push(s);
            }else {//否則就是運(yùn)算符
                //取出兩個(gè)數(shù)據(jù)
                int num1 = Integer.parseInt(dataStack.pop());
                int num2 = Integer.parseInt(dataStack.pop());
                //存放運(yùn)算結(jié)果的變量
                int res = 0;
                //判斷運(yùn)算符繼續(xù)相應(yīng)的運(yùn)算
                if (s.equals("+")){
                    res = num1 + num2;
                }else if (s.equals("-")) {
                    res = num2 - num1;
                }else if (s.equals("*")) {
                    res = num1 * num2;
                }else if (s.equals("/")) {
                    res = num2 / num1;
                }else {
                    throw new RuntimeException("運(yùn)算符異常！");
                }
                //運(yùn)算過后將結(jié)果又放入棧中
                dataStack.push("" + res);
            }
        }
        //最后返回棧中唯一的數(shù)據(jù)既是結(jié)果
        return Integer.parseInt(dataStack.pop());
    }