@@ -0,0 +1,1099 @@
+/**%0A * Problem Link: https://leetcode.com/problems/letter-combinations-of-a-phone-number/%0A * %0A * Iterate all of the possible solutions.%0A */%0A%0Apublic class Solution %7B%0A    private HashMap%3CInteger, String%3E map;%0A    private List%3CString%3E list;%0A    public List%3CString%3E letterCombinations(String digits) %7B%0A        map = new HashMap%3CInteger, String%3E();%0A        map.put(0, %22%22);%0A        map.put(1, %22%22);%0A        map.put(2, %22abc%22);%0A        map.put(3, %22def%22);%0A        map.put(4, %22ghi%22);%0A        map.put(5, %22jkl%22);%0A        map.put(6, %22mno%22);%0A        map.put(7, %22pqrs%22);%0A        map.put(8, %22tuv%22);%0A        map.put(9, %22wxyz%22);%0A        list = new ArrayList%3CString%3E();%0A        combine(digits, 0, %22%22);%0A        return list;%0A    %7D%0A    %0A    private void combine(String digit, int current, String ret) %7B%0A        if(current == digit.length()) %7B%0A            if(ret.length() %3E 0) list.add(ret);%0A            return;%0A        %7D%0A        String s = map.get(digit.charAt(current) - '0');%0A        for(int i=0; i%3Cs.length(); i++) %7B%0A            char c = s.charAt(i);%0A            combine(digit, current + 1, ret + c);%0A        %7D%0A    %7D%0A%7D%0A

Create Letter_Combinations_of_a_Phone_Number.java