Question:
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]
题目如上例
思路:分治法,如果从头遍历字符串,如果遇到运算符号,就以运算符号为分界点,将字符串分为两部分,分别计算两部分的结果,然后将左边的结果集合与右边的结果集合进行交叉运算,将结果放在最终的集合中;如果字符串中根本就没有运算符,则直接将字符串转换为整数存在结果中。
代码如下:
<span style="font-size:14px;">class Solution {
public:
vector<int> diffWaysToCompute(string input) {
vector<int> result;
if(input.length() == 0){
return result;
}
string opt = "-+*";
for(int i = 0; i < input.length(); ++i){
char c = input[i];
if(c == '-' || c == '+' || c == '*'){
string left = input.substr(0,i);
string right = input.substr(i+1);
vector<int> leftres = diffWaysToCompute(left);
vector<int> rightres = diffWaysToCompute(right);
for(int l : leftres){
for(int r : rightres){
switch(c){
case '-':
result.push_back(l-r);
break;
case '+':
result.push_back(l+r);
break;
case '*':
result.push_back(l*r);
break;
}
}
}
}
}
if(result.empty()){
result.push_back(atoi(input.c_str()));
}
return result;
}
};</span>