Different Ways to Add Parentheses——Difficulty：Medium

Problem :

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:

Example 1
Input: "2-1-1".

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


Example 2
Input: "2*3-4*5"

(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
Output: [-34, -14, -10, -10, 10]

**

Algorithm:

**
把每个运算符看作一个分治的点，把字符串分成两部分，这样就把原问题分成两个子问题了。再考虑一下临界条件：若字符串中没有运算符了，就直接把数字作为结果。

**

Code：

class Solution {
public:
    vector<int> diffWaysToCompute(string input) {
        vector<int> result;
        for(int i=0;i<input.size();i++)
        {
            if(input[i]=='+'||input[i]=='*'||input[i]=='-')
            {
                vector<int> left=diffWaysToCompute(input.substr(0,i));
                vector<int> right=diffWaysToCompute(input.substr(i+1));
                for(int k=0;k<left.size();k++)
                {
                    for(int j=0;j<right.size();j++)
                    {
                        if(input[i] == '+')
                            result.push_back(left[k] + right[j]);
                        else if(input[i] == '-')
                            result.push_back(left[k] - right[j]);
                        else
                            result.push_back(left[k] * right[j]);
                    }
                }
            }
        }
        if(result.empty())
            result.push_back(atoi(input.c_str()));
        return result;
    }
};