-
Notifications
You must be signed in to change notification settings - Fork 0
Expand file tree
/
Copy pathLetterCombinations.java
More file actions
45 lines (37 loc) · 1.18 KB
/
LetterCombinations.java
File metadata and controls
45 lines (37 loc) · 1.18 KB
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
import java.util.*;
/**
* 17 电话号码的字母组合
*/
public class LetterCombinations {
public List<String> letterCombinations(String digits) {
List<String> res = new ArrayList<>();
ArrayList<String> list = new ArrayList<>();
list.add(new String(""));
list.add(new String(""));
list.add("abc");
list.add("def");
list.add("ghi");
list.add("jkl");
list.add("mno");
list.add("pqrs");
list.add("tuv");
list.add("wxyz");
// row-第row个digits;col-第row个digits对应字符串的第col个字符
dp(0, digits, new StringBuilder(), list, res);
return res;
}
void dp(int start, String digits, StringBuilder temp, ArrayList<String> list, List<String> res) {
if (temp.length() == digits.length()) {
res.add(new String(temp));
return;
}
int t = digits.charAt(start) - '0';
for (char c : list.get(t).toCharArray()) {
// 添加
temp.append(c);
dp(start + 1, digits, temp, list, res);
// 撤销
temp.deleteCharAt(temp.length() - 1);
}
}
}