【leetcode】17. 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”].

/**
 * @param {string} digits
 * @return {string[]}
 */
var letterCombinations = function(digits) {
    var store = [" ","*","abc","def","ghi","jkl","mno","pqrs","tuv","wxyz"];
    var res = [];
    if(digits ===""){
        return [];
    }
    var get_str = function(input,temp){
        if(input === ""){
            res.push(temp);
            return;
        }
        var letters =store[input[0]];
        var ll = letters.length;
        for(var i=0;i<ll;i++){
            var sub = input.slice(1);
            get_str(sub,temp+letters[i]);
        }
    }
    get_str(digits,"");
    return res;
};