Different Ways to Add Parentheses —— Leetcode（分治思想）

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]

本题是分治法的思想，divide and conquer，代码很好理解；刚开始我想的是对数字做手脚，每两个临近数字组合成一个新数，所有组合情况形成一棵树，最后叶节点就表示输出的所有情况，但这种方法的实现简易程度不如分治。分治方法代码如下：

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> result1 = diffWaysToCompute(input.substr(0, i));
                vector<int> result2 = diffWaysToCompute(input.substr(i+1));
                
                for(int r1 : result1) {
                    for(int r2 : result2) {
                        switch(input[i]) {
                            case '+':
                                result.push_back(r1 + r2);
                                break;
                            case '-':
                                result.push_back(r1 - r2);
                                break;
                            case '*':
                                result.push_back(r1 * r2);
                                break;
                        }
                    }
                }
            }
        }
        
        //如果result为空，说明input为一个数字
        if(result.empty()) {
            result.push_back(atoi(input.c_str()));
        }
        
        return result;
    }
};