leetcode-17. Letter Combinations of a Phone Number

https://leetcode.com/problems/letter-combinations-of-a-phone-number/#/description

问题描述：

Input:Digit string "23"
Output: ["ad", "ae", "af", "bd", "be", "bf", "cd", "ce", "cf"].

思路解析：
将每个按键代表的字符串映射到一个string数组当中，下标对应着按键的顺序。将组合的结果存到LinkedList当中，模拟FIFO队列，每次取出队头元素，然后和其他按键的元素进行组合。

代码如下：

public class Solution {
    public List<String> letterCombinations(String digits) {



        LinkedList<String> result=new LinkedList<String>();

        if(digits.length()==0) return result;

        String[] mapping = new String[] {"0", "1", "abc", "def", "ghi", "jkl", "mno", "pqrs", "tuv", "wxyz"};

       result.add("");

        for(int i=0;i<digits.length();i++)
        {
            int k=Character.getNumericValue(digits.charAt(i));

            while(result.peek().length()==i){


                String t=result.remove();

                for(char s:mapping[k].toCharArray())
                {
                    result.add(t+s);
                }

            }

        }
        return result;



    }
}