首页 > 代码库 > [Leetcode] Letter Combinations of a Phone Number
[Leetcode] Letter Combinations of a Phone Number
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 below.
Input:Digit string "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:
1 public class Solution { 2 public List<String> letterCombinations(String digits) { 3 String[] maps={""," ","abc","def","ghi","jkl","mno","pqrs","tuv","wxyz"}; 4 List<String> result = new ArrayList<String>(); 5 dfs(result, maps, digits,0,""); 6 return result; 7 } 8 9 private void dfs(List<String> result, String[] maps, String digits, int level, String temp) {10 // TODO Auto-generated method stub11 if(level>digits.length())12 return;13 if(digits.length()==level){14 result.add(temp);15 return;16 }17 int curDig=digits.charAt(level)-48;18 for(int i=0;i<maps[curDig].length();++i){ //此时从0开始到maps[curDig]结束，为temp里可以加的字母的取值范围19 temp+=maps[curDig].charAt(i);20 dfs(result, maps, digits, level+1, temp);21 temp=temp.substring(0, temp.length()-1);22 } 23 }24 }
[Leetcode] Letter Combinations of a Phone Number
声明：以上内容来自用户投稿及互联网公开渠道收集整理发布，本网站不拥有所有权，未作人工编辑处理，也不承担相关法律责任，若内容有误或涉及侵权可进行投诉： 投诉/举报 工作人员会在5个工作日内联系你，一经查实，本站将立刻删除涉嫌侵权内容。