OJ四则运算

package StringSS;

import java.util.ArrayList;
import java.util.LinkedList;
import java.util.Queue;
import java.util.Scanner;
import java.util.Stack;

/**
 * @author 王永利
 * @describe:
 * @date 2024/02/25
 */

public class Calculate {
    public static void main(String[] args) {
        Scanner scanner = new Scanner(System.in);
        String expreess = scanner.nextLine();
        // 方法
        String res = calculate(expreess);
        System.out.println(res);
    }
    public static String calculate(String express) {
        Queue<Character> queueF = new LinkedList<>();
        Queue<Integer> queueS = new LinkedList<>();
        char[] chars = express.toCharArray();
        for (int i = 0; i < chars.length; i++) {
            // 得到每个数字
            if (Character.isDigit(chars[i])) {
                int num = 0;
                while(i < express.length() && Character.isDigit(chars[i])) {
                    num = num * 10 + chars[i] - '0';
                    i++;
                }
                if (((LinkedList<Character>) queueF).peekLast() == '*') {
                    int a = ((LinkedList<Integer>) queueS).pollLast();
                    int b = num;
                    int cal = a * b;
                    ((LinkedList<Character>) queueF).pollLast();
                    queueS.add(cal);
                } else if (((LinkedList<Character>) queueF).peekLast() == '/') {
                    int a = ((LinkedList<Integer>) queueS).pollLast();
                    int b = num;
                    int cal = a / b;
                    ((LinkedList<Character>) queueF).pollLast();
                    queueS.add(cal);
                }
                queueS.add(num);
            }
            if (!Character.isDigit(chars[i])) {
                queueF.add(chars[i]);
            }
            if (chars[i] == '/') {
                Integer a = ((LinkedList<Integer>) queueS).pollLast();
                int b = chars[i+1]-'0';
                if (b == 0) {
                    return "error";
                }
                int mul = a * b;
                queueS.add(mul);
            }
            if (chars[i] == '+' || chars[i] == '-') {
                queueF.add(chars[i]);
            }
            if (i == 0 && chars[i] >= '0' && chars[i] <= '9') {
                queueS.add(chars[i]-'0');
            }else if (chars[i] >= '0' && chars[i] <= '9' && chars[i-1] != '*' && chars[i-1] != '/') {
                queueS.add(chars[i]-'0');
            }
        }
        if (queueF.isEmpty()) {
            return queueS.poll().toString();
        } else {  // 遍历计算栈中的+ -
            for (int i = 0; i < queueF.size(); i++) {
                int a = ((LinkedList<Integer>) queueS).pollFirst();
                int b = ((LinkedList<Integer>) queueS).pollFirst();
                int res;
                if (((LinkedList<Character>) queueF).get(i) == '+') {
                    res = a + b;
                } else {
                    res = a - b;
                }
                queueS.add(res);
            }
        }
        return queueS.poll().toString();
    }
}