Calculator系列问题一 LeetCode 224. Basic Calculator

LeetCode 224. Basic Calculator

Implement a basic calculator to evaluate a simple expression string.

The expression string may contain open ( and closing parentheses ), the plus + or minus sign -, non-negative integers and empty spaces .

Example 1:

Input: "1 + 1"
Output: 2

Example 2:

Input: " 2-1 + 2 "
Output: 3

Example 3:

Input: "(1+(4+5+2)-3)+(6+8)"
Output: 23

题目只包含+，-，（，），因此我们可以在遇到括号之前，把数字和符号都存进stack里，当遇到左括号，也都存进去，遇到右括号时，弹出栈并计算结果，直到弹出左括号，把当前结果压栈，，，最后再把所有栈内的数字弹出，计算一次result即可。

    public int calculate(String s) {
        Stack<String> stack = new Stack<>();
        for (int i = 0; i < s.length(); i++) {
            char c = s.charAt(i);
            if (Character.isDigit(c)) {
                int[] res = getNum(s, i);
                int num = res[0];
                i = res[1];
                stack.push(num+"");
            } else if (c == '+' || c == '-' || c =='(') {
                stack.push(c+"");
            } else if (c == ')') {
                int res = 0;
                while (!stack.isEmpty() && !stack.peek().equals("(")) {
                    int num = Integer.parseInt(stack.pop());
                    if (stack.peek().equals("(")) {
                        res = res + num;
                        break;
                    }
                    res = stack.pop().equals("+") ? res + num : res - num;
                }
                stack.pop();
                stack.push(res+"");
            }
        }
        int res = 0;
        while (!stack.isEmpty()) {
            int num = Integer.parseInt(stack.pop());
            if (stack.isEmpty()) {
                res = res + num;
                break;
            }
            res = stack.pop().equals("+") ? res + num : res - num;
        }
        return res;
    }
    public int[] getNum(String s, int i) {
        int[] res = new int[2];
        while (i < s.length() && Character.isDigit(s.charAt(i))) {
            res[0] = res[0] * 10 + s.charAt(i++) - '0';
        }
        res[1] = i - 1;
        return res;
    }