Different Ways to Add Parentheses

[leetcode]Different Ways to Add Parentheses

链接：https://leetcode.com/problems/different-ways-to-add-parentheses/description/

Question

Given a string of numbers and operators, return all possible results from computing all the different possible ways to group numbers and operators. The valid operators are +, - and *.

Example 1

Input: "2-1-1"
Output: [0, 2]
Explanation: 
((2-1)-1) = 0 
(2-(1-1)) = 2

Example 2

Input: "2*3-4*5"
Output: [-34, -14, -10, -10, 10]
Explanation: 
(2*(3-(4*5))) = -34 
((2*3)-(4*5)) = -14 
((2*(3-4))*5) = -10 
(2*((3-4)*5)) = -10 
(((2*3)-4)*5) = 10

Solution

class Solution {
public:
  unordered_map<string, vector<int>> mp;
  vector<int> dfs(string input) {
    if (mp.find(input) != mp.end()) return mp[input];
    vector<int> result;
    for (int i = 0; i < input.size(); i++) {
      if (input[i] == '+' || input[i] == '*' || input[i] == '-') {
        string left_str = input.substr(0, i);
        string right_str = input.substr(i+1);
        vector<int> left = dfs(left_str);
        vector<int> right = dfs(right_str);
        for (auto l: left) {
          for (auto r: right) {
            int ans;
            if (input[i] == '-') {
              ans = l-r;
            } else if (input[i] == '+') {
              ans = l+r;
            } else {
              ans = l*r;
            }
            // print(ans);
            result.push_back(ans);
          }
        }
      }
    }
    // 空的意味着input全是数字（atoi可以将char*转化为数字）
    if (result.empty()) result.push_back(atoi(input.c_str()));
    mp[input] = result;
    return result;
  }
  vector<int> diffWaysToCompute(string input) {
    mp.clear();
    return dfs(input);
  }
};

思路：这道题解法非常的机智，采用递归的方法代替了括号的含义，每次遇到符号的时候都可以递归计算左边或者右边的值，从而将大问题画小，最后缩小到只有数字就可以了。