Leetcode 17. Letter Combinations of a Phone Number- Fb tag

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.

思路：

很简单嘛，就是一一对应，先将每个建的字母写到数组里，然后for循环输入的string，如果读入每个char，char里的数组再去字母表里对应上，for里面的while判断长度，再来个for让他们组合在一起，这一步秒。

时间复杂度：

O(n方）？

代码如下：

class Solution {
    public List<String> letterCombinations(String digits) {
           String[] mapping = new String[] {"0", "1", "abc", "def", "ghi", "jkl", "mno", "pqrs", "tuv", "wxyz"};
           char[] digit = digits.toCharArray();
        
          LinkedList<String> ans = new LinkedList<String>();
        
      if(digits.isEmpty()) return ans;
        ans.add("");
		for(int i =0; i<digits.length();i++){
			int x = Character.getNumericValue(digits.charAt(i));
           while(ans.peek().length() == i ){
               String t= ans.remove();
               for(char q : mapping[x].toCharArray()){
                   ans.add(t+q);
               }
                   
           }
            
        }
        return ans;
    }
}