Leetcode183: 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> res;
        for(int i = 0; i <input.size(); i++)
        {
            char c = input[i];
            if(c == '+' || c == '-' || c == '*')
            {
                vector<int> l = diffWaysToCompute(input.substr(0,i));
                vector<int> r = diffWaysToCompute(input.substr(i+1,input.size()));
                for(auto x : l)
                {
                    for(auto y : r)
                    {
                        if(c == '+')
                        {
                            res.push_back(x+y);
                        }
                        else if(c == '-')
                        {
                            res.push_back(x-y);
                        }
                        else if(c == '*')
                        {
                            res.push_back(x*y);
                        }
                    }
                }
            }
        }
        if(res.empty())
        {
            res.push_back(atoi(input.c_str()));
        }
        return res;
    }
};