题目:
Given a digit string, return all possible letter combinations that the number could represent. A mapping of digit to letters (just like on the telephone buttons) is given as below:
Input:Digit string "23"
Output: ["ad", "ae", "af", "bd", "be", "bf", "cd", "ce", "cf"].
题意:给定一个字符串数字,返回这个字符串数字在电话表上可能的combination,一个map的电话键盘在上图已经给出.
分析:
跟combination是相同的,不同的地方是我们要先建一个dictionary,以方便查找.之后用combination的相同方法,对于每一个数字,在dictionary中查找它所对应的所有的数字.
用arrays来构建这个dictionary的,再用dfs枚举所有解,用于下标代表数字,例如,下标为2,我的字典就会有这种对应的关系:dic[2] = "abc".只要把给定数字字符串的每一个数字转换为int类型,就可以根据字典查找出这个数字所对应的所有字母.当然,再构建字典的时候,我们需要注意dic[0] = "", dic[1] = "".这两个特殊情况,因为电话键盘并没有这两个数字相对应的字符串.
时间复杂度: O(3^n)
实现:
public List<String> letterCombinations(String digits) {
List<String> result = new ArrayList<String>();
String[] map = new String[10];
map[0] = "";
map[1] = "";
map[2] = "abc";
map[3] = "def";
map[4] = "ghi";
map[5] = "jkl";
map[6] = "mno";
map[7] = "pqrs";
map[8] = "tuv";
map[9] = "wxyz";
char[] middleTemp = new char[digits.length()];
dfsGetStr(digits, 0, middleTemp, map, result);
return result;
}
private void dfsGetStr(String digits,int index,
char[] middleStr, String[] map, List<String> result) {
if(index == digits.length()) {
result.add(new String(middleStr));
return ;
}
char strChar = digits.charAt(index);
for(int i=0; i<map[strChar-'0'].length(); i++) {
middleStr[index] = map[strChar-'0'].charAt(i);
dfsGetStr(digits, index+1, middleStr, map, result);
}
}