LeetCode #241. Different Ways to Add Parentheses

题目描述：

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

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 j=0;j<left.size();j++) 
                {
                    for(int k=0;k<right.size();k++) 
                    {
                        if(input[i]=='+') result.push_back(left[j]+right[k]);
                        else if(input[i]=='-') result.push_back(left[j]-right[k]);
                        else result.push_back(left[j]*right[k]);
                    }
                }
            }
        }
        if (result.empty()) result.push_back(stoi(input));
        return result;
    }
};