[LintCode] Letter Combinations of a Phone Number

Given a digit string excluded 01, 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.

Although the above answer is in lexicographical order, your answer could be in any order you want.

 

The order of letter combinations is dicated by the given digit string order. For the given example "23", any of 2's mapping{a, b, c} must appear before any of 3's mapping{d, e, f};

Thus line 18 picks one letter mapping of a digit, add it to the string buffer, then proceed to repeat the same process on the next digit. The output condition is that we've picked 

one mapping for each digit. 

 

public class Solution {
    private HashMap<Character, List<Character>> maps;
    public List<String> letterCombinations(String digits) {
        List<String> combs = new ArrayList<String>();
        if(digits == null || digits.length() == 0) {
            return combs;
        }
        maps = createMapping();
        recurHelper(combs, new StringBuffer(), digits, 0);
        return combs; 
    }
    private void recurHelper(List<String> combs, StringBuffer sb, String digits, int startIdx) {
        if(startIdx == digits.length()) {
            combs.add(sb.toString());
            return;
        }
        List<Character> group = maps.get(digits.charAt(startIdx));
18         for(int j = 0; j < group.size(); j++) {
            sb.append(group.get(j));
            recurHelper(combs, sb, digits, startIdx + 1);
            sb.deleteCharAt(sb.length() - 1);
        }
    }
    private HashMap<Character, List<Character>> createMapping() {
        HashMap<Character, List<Character>> maps = new HashMap<>();
        char currChar = 'a';
        for(char c = '2'; c <= '6'; c++) {
            List<Character> list = new ArrayList<Character>();
            for(int i = 0; i < 3; i++) {
                list.add(currChar);
                currChar++;
            }
            maps.put(c, list);
        }
        List<Character> list7 = new ArrayList<Character>();
        for(int i = 0; i < 4; i++) {
            list7.add(currChar);
            currChar++;
        }
        maps.put('7', list7);
        List<Character> list8 = new ArrayList<Character>();
        for(int i = 0; i < 3; i++) {
            list8.add(currChar);
            currChar++;
        }
        maps.put('8', list8);
        List<Character> list9 = new ArrayList<Character>();
        for(int i = 0; i < 4; i++) {
            list9.add(currChar);
            currChar++;
        }
        maps.put('9', list9);
        return maps;
    }
}

 

 

Example

Given "23"

Return ["ad", "ae", "af", "bd", "be", "bf", "cd", "ce", "cf"]

 

 

Related Problems