每天一题LeetCode[第十五天]
Letter Combinations of a Phone Number
Description:
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.
[pic_url](https://leetcode.com/problems/letter-combinations-of-a-phone-number/?tab=Description)
Input:Digit string "23"
Output: ["ad", "ae", "af", "bd", "be", "bf", "cd", "ce", "cf"].
翻译:
给一个字符串数字,返回所有可能数字的组合。 数字和字母的映射如图所示,具体点击链接。
解题思路:
- 自己想的法子是从头遍历到尾,每次遍历就把之前的字符串种树加上现在字符串可能的数,构成新的字符串集合。然后一开始想用的是ArrayList,然后想到这样数组每次都要删在添加 效率真的不高。看了Top Solution,才想到,用FIFO这种数据结构就好了嘛!!真是。。愚蠢!
Java代码:
public class Solution {
public List<String> letterCombinations(String digits){
if(digits.length()<=0){
return Collections.emptyList();
}
LinkedList<String> ans = new LinkedList<String>();
String[] mapping = new String[] {"0", "1", "abc", "def", "ghi", "jkl", "mno", "pqrs", "tuv", "wxyz"};
ans.add("");
for(int i=0;i<digits.length();i++){
int x=Character.getNumericValue(digits.charAt(i));
while (ans.peek().length()==i){
String str=ans.poll();
for(char c:mapping[x].toCharArray()){
ans.add(str+c);
}
}
}
return ans;
}
}
提高代码质量就是:积累精美的思路,优质的细节的过程。