[leetcode] 224. Basic Calculator 解题报告

题目链接: https://leetcode.com/problems/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.

You may assume that the given expression is always valid.

Some examples:

"1 + 1" = 2
" 2-1 + 2 " = 3
"(1+(4+5+2)-3)+(6+8)" = 23

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

思路: 利用递归的思想如果碰到左括号就递归到下一层处理括号里的计算, 如果碰到右括号就返回当前一层的值; 

代码如下:

class Solution {
public:
    int DFS(string &s, int& i)
    {
        int ans = 0, c = 1, num = 0;
        while(i < s.size())
        {
            if(isdigit(s[i])) num = num*10 + (s[i]-'0');
            else if(s[i]=='+'||s[i]=='-') ans+=c*num, num=0, c=(s[i]=='+'?1:-1);
            else if(s[i]=='(') num = DFS(s, ++i);
            else if(s[i]==')') return ans += (c*num);
            i++;
        }
        return ans;
    }
    
    int calculate(string s) {
        s = "(" + s + ")";
        int k = 1;
        return DFS(s, k);
    }
};