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".

((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]

该提可以利用分治算法，每遇到一个符号就以此符号为界，将两边的算式进行相同的计算，

class Solution {
public:
    vector<int> diffWaysToCompute(string input) {
      vector<int> sum;
    int size=input.size();
        for(int i=0;i<size;++i)
        {
        char temp=input[i];
if(temp=='+' || temp=='-' || temp== '*') 
{
vector<int> ans=diffWaysToCompute(input.substr(0,i) );
vector<int> ans1=diffWaysToCompute(input.substr(i+1));
for(int j=0;j<ans.size();++j)
{
for(int k=0;k<ans1.size();++k)
{
if(temp=='+')
        sum.push_back(ans[j]+ans1[k]);
        else if(temp=='-')
        sum.push_back(ans[j]-ans1[k]);
        else if(temp=='*')
        sum.push_back(ans[j]*ans1[k]);
}
}
}
}
if(sum.empty())
{
int num;
stringstream ss;
ss<<input;
ss>>num;
sum.push_back(num);
}
return sum;
    }
};