772. Basic Calculator III

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 .

The expression string contains only non-negative integers, +, -, *, / operators , open ( and closing parentheses ) and empty spaces . The integer division should truncate toward zero.

You may assume that the given expression is always valid. All intermediate results will be in the range of [-2147483648, 2147483647].

Some examples:

"1 + 1" = 2
" 6-4 / 2 " = 4
"2*(5+5*2)/3+(6/2+8)" = 21
"(2+6* 3+5- (3*14/7+2)*5)+3"=-12

Note: Do not use the eval built-in library function.

方法1:

思路：

和前两道题对比，连栈都省了。主要矛盾变成了处理括号。主流方法采用递归的形式，将括号内的表达式一层层的递归出来一个单个数字，那么就可以assume剩下需要处理的，是和Basic Calculator II 一样的问题。

class Solution {
public:
    int calculate(string s) {
        stack<int> st;
        long num = 0; 
        int result = 0;
        int op ='+';
        
        for (int i = 0; i < s.size(); i++) {
            char c = s[i];
            if (isdigit(c)) {
                num = num * 10 + c - '0';
            }
            else if (c == '(') {
                int j = i, count = 0;
                for (;i < s.size(); i++) {
                    if (s[i] == '(') count ++;
                    if (s[i] == ')') count --;
                    if (count == 0) break;
                }
                num = calculate(s.substr(j + 1, i - j - 1));
            }
            if (!isdigit(c) && !isspace(c) || i == s.size() - 1){
                if (op == '+') st.push(num);
                if (op == '-') st.push(-num);
                if (op == '*' || op == '/') {
                    int top = st.top();
                    st.pop();
                    if (op == '*') st.push(top * num);
                    if (op == '/') st.push(top / num);
                }
                op = s[i];
                num = 0;
            }
        }
        
        while (!st.empty()) {
            result += st.top();
            st.pop();
        }
        return result;
    }
};

换一种写法：

class Solution {
public:
    int calculate(string s) {
        int result = 0, curRes = 0;
        long num = 0;
        char op = '+';
        for (int i = 0; i < s.size(); i++) {
            char c = s[i];
            if (isdigit(c)) {
                num = num * 10 + c - '0';
            }
            else if (c == '(') {
                int j = i, count = 0;
                for (;i < s.size(); i++) {
                    if (s[i] == '(') count ++;
                    if (s[i] == ')') count --;
                    if (count == 0) break;
                }
                num = calculate(s.substr(j + 1, i - j - 1));
            }
            if (c == '+' || c == '-' || c == '*' || c == '/' || i == s.size() - 1) {
              switch(op) {
                  case '+': curRes += num; break;
                  case '-': curRes -= num; break;
                  case '*': curRes *= num; break;
                  case '/': curRes /= num; break;
              }      
              if (c == '+' || c =='-' || i == s.size() - 1) {
                  result += curRes;
                  curRes = 0;
              }  
              op = s[i];
              num = 0;
            }
        }
        return result;
    }
};