leetcode #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 {
    
    private Map<Character, char[]> getLettersMap() {
        Map<Character, char[]> lettersMap = new HashMap<>();
        lettersMap.put('0', new char[]{});
        lettersMap.put('1', new char[]{});                
        lettersMap.put('2', new char[]{'a', 'b', 'c'});                
        lettersMap.put('3', new char[]{'d', 'e', 'f'});                
        lettersMap.put('4', new char[]{'g', 'h', 'i'});    
        lettersMap.put('5', new char[]{'j', 'k', 'l'});    
        lettersMap.put('6', new char[]{'m', 'n', 'o'});    
        lettersMap.put('7', new char[]{'p', 'q', 'r', 's'});    
        lettersMap.put('8', new char[]{'t', 'u', 'v'});    
        lettersMap.put('9', new char[]{'w', 'x', 'y', 'z'});    
        
        return lettersMap;
    }

    public List<String> letterCombinations(String digits) {
         List<String> res = new ArrayList<>();
        if(digits == null || digits.length() <1)return res;
        
        //创建一个string builder
      StringBuilder sb = new StringBuilder();
        Map<Character , char[]> lettersMap = getLettersMap();
        helper(digits,sb,lettersMap, res);
        
        return res;
    }
    
    private void helper(String digits, StringBuilder sb , Map<Character, char[]> lettersMap, List<String> res){
        
         if(sb.length() == digits.length()){
             res.add(sb.toString());
             return;
         }
        
        for(char ch : lettersMap.get(digits.charAt(sb.length()))){
            sb.append(ch);
            helper(digits,sb,lettersMap,res);
            sb.deleteCharAt(sb.length()-1);
        }
    }
}