热榜题解有错

热榜第一 无法解决 400+(100/5)+5这个用例， 而我的可以。

import java.util.*;
public class Main {
    public static void main(String[] args) {
        Scanner scan = new Scanner(System.in);
        while (scan.hasNext()) {
            String s = scan.nextLine();
            s = s.replace("[", "(");
            s = s.replace("{", "(");
            s = s.replace("]", ")");
            s = s.replace("}", ")");
            Main test = new Main();
            int res = test.solution(s);
            System.out.println(res);
        }
    }
    public int solution(String s) {
        //括号用递归处理
        char ops = '+';
        Stack<Integer> stack = new Stack<>();
        for (int i = 0; i < s.length(); i++) {
            char c = s.charAt(i);
            if (c == ' ') continue;
            if (Character.isDigit(c)) {
                int num = 0;
                while (i < s.length() && Character.isDigit(s.charAt(i))) {
                    num = num * 10 + s.charAt(i) - '0';
                    i++;
                }
                i--;
                if (ops == '+') stack.push(num);
                else if (ops == '-') stack.push(-num);
                else if (ops == '*') stack.push(stack.pop() * num);
                else if (ops == '/') stack.push(stack.pop() / num);
            }
            else if (c == '+' || c == '-' || c == '*' || c == '/') {
                ops = c;
            }
            else if (c == '(') {
                int left = i;
                int right = i + 1;
                int count = 1;
                while (right < s.length() && count > 0) {
                    if (s.charAt(right) == '(') count++;
                    else if (s.charAt(right) == ')') count--;
                    right++;
                }
                i = right - 1;
                int num = solution(s.substring(left + 1, right - 1));
                if (ops == '+') stack.push(num);
                else if (ops == '-') stack.push(-num);
                else if (ops == '*') stack.push(stack.pop() * num);
                else if (ops == '/') stack.push(stack.pop() / num);
            }
        }
        int res = 0;
        while (!stack.isEmpty()) res += stack.pop();
        return res;
    }
}