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>();
for (int i = 0; i < input.length(); i++) {
int c = input.charAt(i);
if (c == '+' || c == '-' || c == '*') {
List<Integer> lefts = diffWaysToCompute(input.substring(0, i));
List<Integer> rights = diffWaysToCompute(input.substring(i + 1));
for (int left : lefts) {
for (int right : rights) {
if (c == '+') {
res.add(left + right);
} else if (c == '-') {
res.add(left - right);
} else if (c == '*') {
res.add(left * right);
}
}
}
}
}
if (res.isEmpty()) {
res.add(Integer.parseInt(input));
}
return res;
}
}
没有评论:
发表评论