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.
这题没什么特别的地方,乖乖地写循环吧
public class Solution {
public List<String> letterCombinations(String digits) {
char[][] letters={{},{},{'a','b','c'},{'d','e','f'},{'g','h','i'},{'j','k','l'},{'m','n','o'},{'p','q','r','s'},{'t','u','v'},{'w','x','y','z'}};
List<String> list = new ArrayList<String>();
for(int i = 0; i < digits.length(); i++){
if(list.size() == 0){
for(int p = 0; p < letters[digits.charAt(i) - '0'].length ; p++){
list.add(String.valueOf(letters[digits.charAt(i) - '0'][p]));
}
continue;
}
List<String> tmp = new ArrayList<String>();
for(int j = 0 ; j < letters[digits.charAt(i) - '0'].length ; j++){
for(String s: list){
tmp.add(s+letters[digits.charAt(i) - '0'][j]);
}
}
list = tmp;
}
return list;
}
}