Given a digit string excluded 01
, return all possible letter combinations that the number could represent.
A mapping of digit to letters (just like on the telephone buttons) is given below.
注意事项
以上的答案是按照词典编撰顺序进行输出的,不过,在做本题时,你也可以任意选择你喜欢的输出顺序。
给定 "23"
返回 ["ad", "ae", "af", "bd", "be", "bf", "cd", "ce", "cf"]
/*
给定一个数字字符串除外01,返回所有可能的字母组合,该数字可以代表。
数字到字母(如电话按钮)的映射如下。
思路:
1.先把数字对应的字母存入Hash Map中
2.回溯法组合
*/
public class Solution {
public ArrayList<String> letterCombinations(String digits) {
ArrayList<String> result = new ArrayList<String>();
if (digits == null || digits.equals("")) {
return result;
}
Map<Character, char[]> map = new HashMap<Character, char[]>();
map.put('2', new char[] { 'a', 'b', 'c' });
map.put('3', new char[] { 'd', 'e', 'f' });
map.put('4', new char[] { 'g', 'h', 'i' });
map.put('5', new char[] { 'j', 'k', 'l' });
map.put('6', new char[] { 'm', 'n', 'o' });
map.put('7', new char[] { 'p', 'q', 'r', 's' });
map.put('8', new char[] { 't', 'u', 'v'});
map.put('9', new char[] { 'w', 'x', 'y', 'z' });
StringBuilder sb = new StringBuilder();
helper(map, digits, sb, result);
return result;
}
private void helper(Map<Character, char[]> map, String digits,
StringBuilder sb, ArrayList<String> result) {
//长度相同
if (sb.length() == digits.length()) {
result.add(sb.toString());
return ;
}
//
for (char c : map.get(digits.charAt(sb.length()/*长度*/))) {
sb.append(c);
helper(map, digits, sb, result);
sb.deleteCharAt(sb.length() - 1);//回退
}
}
}