leetcode刷题，总结，记录，备忘 241

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

题目的提示是分而治之，把大问题分成2个部分，分别求解，再求得最终结果。遍历字符串，找到运算符号，以其为中点，分为2段，分别进行递归操作，将得到的结果依次根据运算符的类型进行预算，从而得到最终的结果，递归结束的条件是当字符串中只有1个数字的时候，得到单个的结果，返回上层的递归层，一直递推到最上层得到最终的结果。

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] == '*')
            {
                char c = input[i];
                vector<int> vl = diffWaysToCompute(input.substr(0, i));
                vector<int> vr = diffWaysToCompute(input.substr(i+1));
                
                for (int i = 0; i < vl.size(); ++i)
                {
                    for (int j = 0; j < vr.size(); ++j)
                    {
                        switch(c)
                        {
                            case '+':result.push_back(vl[i] + vr[j]);
                            break;
                            case '-':result.push_back(vl[i] - vr[j]);
                            break;
                            case '*':result.push_back(vl[i] * vr[j]);
                            break;
                            default:
                            break;
                        }
                    }
                }
            }
        }
        
        if (result.size() == 0)
        {
            result.push_back(atoi(input.c_str()));
        }
        
        return result;
    }
};