class Solution {
public List<String> letterCombinations(String digits) {
String[] map = {"", "", "abc", "def", "ghi", "jkl", "mno", "pqrs", "tuv", "wxyz"};
StringBuilder temp = new StringBuilder();
List<String> res = new ArrayList<>();
if(digits.length() == 0){
return res;
}
dfs(digits, 0, temp, map, res);
return res;
}
public void dfs(String digits, int idx, StringBuilder temp, String[] map, List<String> res){
if(idx == digits.length()){
res.add(temp.toString());
return;
}
int cur = digits.charAt(idx) - '0';
int len = temp.length();
for(int i = 0; i < map[cur].length(); i++){
temp.append(map[cur].charAt(i));
dfs(digits, idx + 1, temp, map, res);
temp.setLength(len);
}
}
}
class Solution {
public List<String> letterCombinations(String digits) {
List<String> list = new ArrayList<>();
if (digits == null || digits.isEmpty()) {
return list;
}
String[] str = new String[]{"abc", "def", "ghi", "jkl", "mno", "pqrs", "tuv", "wxyz"};
String[] arr = new String[digits.length()];
for (int i = 0; i < digits.length(); i++) {
char c = digits.charAt(i);
arr[i] = str[Integer.valueOf(Character.toString(c)) - 2];
}
dfs(arr, 0, new StringBuilder(), list);
return list;
}
public void dfs(String[] arr, int index, StringBuilder currStr, List<String> list) {
if (index == arr.length) {
list.add(currStr.toString());
return;
}
String str = arr[index];
int len = str.length();
for (int i = 0; i < len; i++) {
currStr.append(str.charAt(i));
dfs(arr, index + 1, currStr, list);
currStr.deleteCharAt(index);
}
}
}
详细解答