java算法_电话号码的字母组合
问题:给定一个仅包含数字 2-9 的字符串,返回所有它能表示的字母组合。答案可以按 任意顺序 返回。 给出数字到字母的映射如下(与电话按键相同)。注意 1 不对应任何字母。
运行结果
/**
* 2 * @Author: LJJ
* 3 * @Date: 2023/7/12 9:05
* 4
*/
import java.util.ArrayList;
import java.util.HashMap;
import java.util.List;
import java.util.Map;
public class LetterCombinations {
public static final Map<Character,String> digitToLetters = new HashMap<>();
static {
digitToLetters.put('2', "abc");
digitToLetters.put('3', "def");
digitToLetters.put('4', "ghi");
digitToLetters.put('5', "jkl");
digitToLetters.put('6', "mno");
digitToLetters.put('7', "pqrs");
digitToLetters.put('8', "tuv");
digitToLetters.put('9', "wxyz");
}
public List<String> letterCombinations(String digits){
List<String> combinations = new ArrayList<>();
if (digits==null|| digits.length()==0){
return combinations;
}
backtrack(0,digits,new StringBuilder(),combinations);
return combinations;
}
private void backtrack(int index,String digits,StringBuilder current,List<String> combinations){
if (index==digits.length()){
combinations.add(current.toString());
return;
}
char digit = digits.charAt(index);
String letters = digitToLetters.get(digit);
for (char letter : letters.toCharArray()){
current.append(letter);
backtrack(index+1,digits,current,combinations);
current.deleteCharAt(current.length()-1);
}
}
public static void main(String[] args) {
String digits = "234";
LetterCombinations letterCombinations = new LetterCombinations();
List<String> combinations = letterCombinations.letterCombinations(digits);
System.out.println(combinations);
}
}
复制即用,需要代码文档,算法解析的私得