中缀转后缀表达式，带括号的后缀表达式综合计算器，Java栈数据结构实现

import java.util.ArrayList;
import java.util.List;
import java.util.Stack;
/**
 * @Author: Yeman
 * @Date: 2021-10-27-21:59
 * @Description:
 */
public class PolandNotation {
    public static void main(String[] args) {
        //给一个中缀表达式
        String expression = "1+((2+3)*4)-10";
        //将中缀表达式放入List
        List<String> infixList = toInfixExpression(expression);
        //将中缀表达式对应的List转换为逆波兰表达式对应的List
        List<String> suffixList = parseSuffixExpression(infixList);
        //用逆波兰表达式（后缀表达式）进行计算
        int result = calculate(suffixList);
        System.out.println(result);
    }
    //将中缀表达式放入List中
    public static List<String> toInfixExpression(String expression){
        List<String> ls = new ArrayList<>();
        int i = 0; //相当于一个指针，用来遍历表达式
        String str; //用来拼接多位数
        char ch; //每遍历一个，就存入ch
        do {
            //如果不是数,直接加入
            if ((ch = expression.charAt(i)) < 48 || (ch = expression.charAt(i)) > 57){
                ls.add(ch + "");
                i++;
            }else {
                str = "";
                while (i < expression.length() && (ch = expression.charAt(i)) >= 48 && (ch = expression.charAt(i)) <= 57){
                    str += ch;
                    i++;
                }
                ls.add(str);
            }
        }while (i < expression.length());
        return ls;
    }
    //将中缀表达式对应的List转成逆波兰表达式对应的List
    public static List<String> parseSuffixExpression(List<String> infixList){
        Stack<String> s1 = new Stack<String>(); //符号栈
        //由于操作中没有进行过pop，可以使用List<String>替换中间结果栈Stack<String>
        List<String> s2 = new ArrayList<String>();
        for (String item : infixList){
            if (item.matches("\\d+")){
                s2.add(item);
            }else if (item.equals("(")){
                s1.push(item);
            }else if (item.equals(")")){
                while (!s1.peek().equals("(")){
                    s2.add(s1.pop());
                }
                s1.pop(); //将 ( pop出去
            }else {
                while (s1.size() != 0 && Operation.getValue(s1.peek()) >= Operation.getValue(item)){
                    s2.add(s1.pop());
                }
                s1.push(item);
            }
        }
        while (s1.size() != 0){
            s2.add(s1.pop());
        }
        return s2;
    }
    //逆波兰表达式计算
    public static int calculate(List<String> expressionList){
        //创建一个栈
        Stack<String> strings = new Stack<String>();
        //遍历列表
        for (String item : expressionList){
            if (item.matches("\\d+")){ //匹配多位数
                strings.push(item);
            }else {
                int num2 = Integer.parseInt(strings.pop());
                int num1 = Integer.parseInt(strings.pop());
                String ch = item;
                int res = 0;
                switch (ch){
                    case "+":
                        res = num1 + num2;
                        break;
                    case "-":
                        res = num1 - num2;
                        break;
                    case "*":
                        res = num1 * num2;
                        break;
                    case "/":
                        res = num1 / num2;
                        break;
                    default:
                        throw new RuntimeException("运算符不正确！");
                }
                strings.push(res + "");
            }
        }
        //for循环结束留在栈里的即为计算结果
        return Integer.parseInt(strings.pop());
    }
}
//该类返回运算符优先级
class Operation{
    private static int ADD = 1;
    private static int SUB = 1;
    private static int MUL = 2;
    private static int DIV = 2;
    public static int getValue(String operation){
        int res = 0;
        switch (operation){
            case "+":
                res = ADD;
                break;
            case "-":
                res = SUB;
                break;
            case "*":
                res = MUL;
                break;
            case "/":
                res = DIV;
                break;
            default:
                System.out.println("运算符不正确！");
                break;
        }
        return res;
    }
}