题目:
给定一个仅包含数字 2-9 的字符串,返回所有它能表示的字母组合。
给出数字到字母的映射如下(与电话按键相同)。注意 1 不对应任何字母。
示例:
输入:“23”
输出:[“ad”, “ae”, “af”, “bd”, “be”, “bf”, “cd”, “ce”, “cf”].
解答1:
public class LetterCombinations {
public static List<String> letterCombinations(String digits){
if(digits ==null || digits.length() ==0) {
return new ArrayList();
}
Map<Character,String> map = new HashMap<Character,String>();
map.put('2', "abc");
map.put('3', "def");
map.put('4', "ghi");
map.put('5', "jkl");
map.put('6', "mno");
map.put('7', "pqrs");
map.put('8', "tuv");
map.put('9', "wxyz");
List<String> res = new LinkedList<String>();
hepler("",digits,0,res,map);
return res;
}
private static void hepler(String s,String digits,int i,List<String> res,Map<Character,String> map) {
if(i == digits.length()) {
res.add(s);
return;
}
String letters = map.get(digits.charAt(i));
for(int j=0;j<letters.length();j++) {
hepler(s+letters.charAt(j), digits, i+1, res, map);
}
}
public static void main(String[] args) {
System.out.println(letterCombinations("47"));
}
}
解答2:
vector<String> letterCombinations(string digits){
vector<string> res;
string charmap[10] = {"0","1","abc","def","ghi","jkl","mno","pqrs","tuv","wxyz"};
res.push_back("");
for(int j=0;i<digits.size();i++){
vector<string> tempress;
string chars = charmap[digits[i]-'0'];
for(int c=0;c<chars.size();c++)
for(int j=0;j<res.size();j++)
tempress.push_back(res[j]+chars[c]);
res = tempress;
}
return res;
}