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]
递归,扫描到一个运算符号就计算左右两边所有值的运算结果。
public class Solution {
public List<Integer> diffWaysToCompute(String input) {
List<Integer> res = new ArrayList<Integer>();
if (input == null || input.length() == 0) {
return res;
}
for (int i = 0; i < input.length(); i++) {
char c = input.charAt(i);
if (c == '+' || c == '-' || c == '*') {
List<Integer> left = diffWaysToCompute(input.substring(0, i));
List<Integer> right = diffWaysToCompute(input.substring(i + 1));
for (int j = 0; j < left.size(); j++) {
for (int k = 0; k < right.size(); k++) {
res.add(caculate(left.get(j), right.get(k), c));
}
}
}
}
if (res.size() == 0) {
// 如果输入的内容直接是一个数字
res.add(Integer.parseInt(input));
}
return res;
}
private static int caculate(int x, int y, char c) {
switch (c) {
case '+':
return x + y;
case '-':
return x - y;
case '*':
return x * y;
default:
return 0;
}
}
}