Given a string that contains only digits 0-9
and a target value, return all possibilities to add binary operators (not unary) +
, -
, or *
between the digits so they evaluate to the target value.
Examples:
"123", 6 -> ["1+2+3", "1*2*3"] "232", 8 -> ["2*3+2", "2+3*2"] "105", 5 -> ["1*0+5","10-5"] "00", 0 -> ["0+0", "0-0", "0*0"] "3456237490", 9191 -> []
solution:
need to find all possible results, use dfs. keep two veribales, one is current value, one is last different value.
for example, if current value is 3, last diff is 2 next vaue is 4
+ for next loop, current value is 3 +4, diff is 4
- for next loop, current value is 3-4, diff is -3
* for next loop, current value is (3-2) + 2 *4, diff is 2*4
public List<String> addOperators(String num, int target) {
List<String> res = new ArrayList<String>();
dfs(num, target, 0, 0, "", res);
return res;
}
public void dfs(String num, int target, long cur, long diff, String temp, List<String> res) {
if(cur == target && num.length() == 0) {
res.add(temp);
}
for(int i = 1; i<=num.length(); i++) {
String str = num.substring(0, i);
if(str.length()>1 && '0' == str.charAt(0)) return;
String next = num.substring(i);
if(temp.length() >0) {
dfs(next, target, Long.parseLong(str) + cur, Long.parseLong(str), temp + "+" +str, res);
dfs(next, target, cur - Long.parseLong(str), -Long.parseLong(str), temp + "-" +str, res);
dfs(next, target, (cur - diff) + diff * Long.parseLong(str), Long.parseLong(str)*diff, temp + "*" +str, res);
} else {
dfs(next, target, Long.parseLong(str), Long.parseLong(str), str, res);
}
}
}