17. Letter Combinations of a Phone Number
Description
Given a string containing digits from 2-9 inclusive, 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. Note that 1 does not map to any letters.
Example
Example:
Input: “23”
Output: [“ad”, “ae”, “af”, “bd”, “be”, “bf”, “cd”, “ce”, “cf”].
Note:
Although the above answer is in lexicographical order, your answer could be in any order you want.
Solution: (Java)
class Solution {
List<String> result = new ArrayList<>();
Map<Character, String> map = new HashMap<Character, String>(){{
put('2', "abc");
put('3', "def");
put('4', "ghi");
put('5', "jkl");
put('6', "mno");
put('7', "pqrs");
put('8', "tuv");
put('9', "wxyz");
}};
public List<String> letterCombinations(String digits) {
String combination = "";
if (digits.length() != 0)
backtrack(combination, digits);
return result;
}
public void backtrack(String combination, String next_digits) {
if (next_digits.length() == 0) {
result.add(combination);
return;
}
String dig_to_str = map.get(next_digits.charAt(0));
for (int i = 0; i < dig_to_str.length(); i++) {
String combine = combination + dig_to_str.charAt(i);
backtrack(combine, next_digits.substring(1));
}
}
}
思路
本题难度中等,用到的是 回溯法
,算法伪代码:
def backtrack(combination, next_digits):
if 下一个数字为空(即数字遍历完了):
将 combination(组合的字符串)加入结果中,return
else 数字不为空:
foreach letter in next_digits[0]对应的字母集合:
combination = combination + letter; //真正写代码时,combination不能被赋值覆盖
backtrack(combination, next_digits[1:]; //递归