[leet code] Letter Combinations of a Phone Number

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

Input:Digit string "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.

===============

Analysis:

Same idea as the [leet code] Subsets problem.  The changes for this problem is to map the digits to letters before constructing a possible subset.

public class Solution {
    public ArrayList<String> letterCombinations(String digits) {
        ArrayList<String> rs = new ArrayList<String>();
        helper(rs, digits, "", 0);
        return rs;
    }
    
    public void helper(ArrayList<String> rs, String digits, String singleCom, int index){
        if(singleCom.length()==digits.length()) rs.add(singleCom); // a possible combination constructured
        else{
            for(int i=index; i<digits.length(); i++){ 
                int num = Character.getNumericValue(digits.charAt(i));
                if (num == 0) continue;
                String letters = numMapLetters(num); // get letters
                for(int j=0; j<letters.length(); j++){
                    singleCom+=letters.charAt(j);
                    helper(rs, digits, singleCom, i+1);
                    singleCom = singleCom.substring(0,singleCom.length()-1);                    
                }
            }
        }
    }
    
    public String numMapLetters(int digit){
        String letters="";
        switch(digit){
            case 2: letters = "abc";
            break;
            case 3: letters = "def";
            break;
            case 4: letters = "ghi";
            break;
            case 5: letters = "jkl";
            break;
            case 6: letters = "mno";
            break;
            case 7: letters = "pqrs";
            break;
            case 8: letters = "tuv";
            break;
            case 9: letters = "wxyz";
            break;
            case 0: letters = " ";
            break;
        }
        return letters;
    }
}