LeetCode/Scripts/241.cpp at master · zzz0906/LeetCode · GitHub

1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
class Solution {
public:
    vector<int> diffWaysToCompute(string input) {
        vector<int> answer;
        if (input.length() == 0) return answer;
        if ((input.find("+") == std::string::npos) && (input.find("-") == std::string::npos) && (input.find("*") == std::string::npos)){
            answer.push_back(stoi(input));
            return answer;
        }
        for (int i = 0; i < input.size(); i++)
            if (input[i] == '+' || input[i] == '-' || input[i] == '*'){
                vector<int> cu1,cu2;
                switch (input[i]){
                    case '+':
                        cu1 = diffWaysToCompute(input.substr(0,i));
                        cu2 = diffWaysToCompute(input.substr(i+1,input.size()- (i + 1) + 1));
                        for (int i = 0; i < cu1.size(); i++)
                            for (int j = 0; j < cu2.size(); j++)
                                answer.push_back(cu1[i] + cu2[j]);
                        break;
                    case '-':
                        cu1 = diffWaysToCompute(input.substr(0,i));
                        cu2 = diffWaysToCompute(input.substr(i+1,input.size()- (i + 1) + 1));
                        for (int i = 0; i < cu1.size(); i++)
                            for (int j = 0; j < cu2.size(); j++)
                                answer.push_back(cu1[i] - cu2[j]);
                        break;
                    default:
                        cu1 = diffWaysToCompute(input.substr(0,i));
                        cu2 = diffWaysToCompute(input.substr(i+1,input.size()- (i + 1) + 1));
                        for (int i = 0; i < cu1.size(); i++)
                            for (int j = 0; j < cu2.size(); j++)
                                answer.push_back(cu1[i] * cu2[j]);

                }
            }
        return answer;
    }
};