leetcode学习笔记53

17. Letter Combinations of a Phone Number

Given a string containing digits from 2-9 inclusive, 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. Note that 1 does not map to any letters.

Example:

Input: “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.
这道题采用队列的形式来实现

class Solution {
    String[] map={"","","abc","def","ghi","jkl","mno","pqrs","tuv","wxyz"};
    public List<String> letterCombinations(String digits) {
        LinkedList<String> res=new LinkedList<String>();
        if(digits.isEmpty()) return res;
        res.offer("");
        for(int i=0;i<digits.length();i++){
            int num=Character.getNumericValue(digits.charAt(i));
            while(res.peek().length()==i){
                String str =res.poll();
                for(char c:map[num].toCharArray()){
                    res.offer(str+c);
                }
            }
        }
        
        return res;       
    }
}