数据结构：简单计算机实现

package com.itcast.datastructure.stack.suffixcomputer;

import java.util.ArrayList;
import java.util.List;
import java.util.Stack;

public class ComputerDemo1 {
    public static void main(String[] args) {
        String expression="1+20*3+4";
        List<String> list=toList(expression);
        System.out.println(list);
        List<String> list1=infixToSuffix(list);
        System.out.println(list1);
        int res=resolve(list1);
        System.out.println(res);
    }
//中缀表达式（list集合）转后缀表达式（list集合）
    public static List<String> infixToSuffix(List<String> list){
        Stack<String> s1=new Stack<>();
        List<String> s2=new ArrayList<>();
        for (String ss:list) {
            if (ss.matches("\\d+")) {
                s2.add(ss);
            } else if (ss.equals("(")) {
                s1.push(ss);
            } else if (ss.equals(")")) {
                while (s1.peek() != "(") {
                    s2.add(s1.pop());
                }
                s1.pop();
            }else{
                while (s1.size() != 0 && Operator.getPriority(s1.peek()) >= Operator.getPriority(ss)) {
                    s2.add(s1.pop());
                }
                s1.push(ss);
            }
        }
        while (s1.size()!=0){
            s2.add(s1.pop());
        }
        return s2;
    }
//数学表达式转成中缀表达式（list集合）
    public static List<String> toList(String expression){
        List<String> list=new ArrayList<>();
        String s="";
        char ch;
        for (int i=0;i<expression.length();i++){
            ch=expression.charAt(i);
            if(ch<48||ch>57){
                list.add(""+ch);
            }else{
                s+=ch;
                if(i==expression.length()-1||expression.charAt(i+1)<48||expression.charAt(i+1)>57){
                    list.add(s);
                    s="";
                }
            }
        }
        return list;
    }
//解析后缀表达式（list集合）
    public static int resolve(List<String> list){
        Stack<String> stack=new Stack<>();
        for (String s: list){
            if(s.matches("\\d+")){
                stack.push(s);
                continue;
            } else{
                int num2=Integer.parseInt(stack.pop());
                int num1=Integer.parseInt(stack.pop());
                stack.push(""+cal(num1,num2,s));
            }
        }
        return Integer.parseInt(stack.pop());
    }
    public static int cal(int num1,int num2,String s){
        int res=0;
        switch (s){
            case "+": res=num1+num2;break;
            case "-": res=num1-num2;break;
            case "*": res=num1*num2;break;
            case "/": res=num1/num2;break;
            default:throw new RuntimeException("参数错误");
        }
        return res;
    }
}
class Operator{
    public static final int ADD=1;
    public static final int SUB=1;
    public static final int MUL=2;
    public static final int DIV=2;
    public static int getPriority(String ope){
        int res=0;
        switch (ope){
            case "+":res=ADD;break;
            case "-":res=SUB;break;
            case "*":res=MUL;break;
            case "/":res=DIV;break;
            default:res=0;
        }
        return res;
    }
}