思路
![在这里插入图片描述](https://img-blog.csdnimg.cn/20200217134508127.jpg?x-oss-process=image/watermark,type_ZmFuZ3poZW5naGVpdGk,shadow_10,text_aHR0cHM6Ly9ibG9nLmNzZG4ubmV0L3Fpaml1bGl1c2hpc2Fu,size_16,color_FFFFFF,t_70)
代码
public class Solution0017 {
private List<String> result =new ArrayList<>();
private String[] map= {
"abc",
"def",
"ghi",
"jkl",
"mno",
"pqrs",
"tuv",
"wxyz"
};
public List<String> letterCombinations(String digits) {
if (digits.isEmpty())
return result;
String p="";
backtrack(p,digits);
return result;
}
public void backtrack(String p,String digits) {
if(digits.isEmpty()) {
result.add(p);
return;
}
int index=digits.charAt(0) - '2';
for(int i=0;i<map[index].length();i++) {
backtrack(p+map[index].charAt(i),digits.substring(1));
}
return;
}
}