forked from szl0072/Leetcode-Solution-Code
-
Notifications
You must be signed in to change notification settings - Fork 1
/
Copy pathExpressionAddOperators.java
63 lines (54 loc) · 1.88 KB
/
ExpressionAddOperators.java
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
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
package leetcode;
import java.util.ArrayList;
import java.util.List;
/**
* Project Name : Leetcode
* Package Name : leetcode
* File Name : ExpressionAddOperators
* Creator : Edward
* Date : Dec, 2017
* Description : 282. Expression Add Operators
*/
public class ExpressionAddOperators {
/**
* 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 -> []
time : 不知道
space : O(n)
* @param num
* @param target
* @return
*/
public List<String> addOperators(String num, int target) {
List<String> res = new ArrayList<>();
if (num == null || num.length() == 0) return res;
helper(res, "", num, target, 0, 0, 0);
return res;
}
private void helper(List<String> res, String path, String num, int target, int pos, long val, long pre) {
if (pos == num.length()) {
if (target == val) {
res.add(path);
return;
}
}
for (int i = pos; i < num.length(); i++) {
if (i != pos && num.charAt(pos) == '0') break;
long cur = Long.parseLong(num.substring(pos, i + 1));
if (pos == 0) {
helper(res, path + cur, num, target, i + 1, cur, cur);
} else {
helper(res, path + "+" + cur, num, target, i + 1, val + cur, cur);
helper(res, path + "-" + cur, num, target, i + 1, val - cur, -cur);
helper(res, path + "*" + cur, num, target, i + 1, val - pre + pre * cur, pre * cur);
}
}
}
}