17. letter-combinations-of-a-phone-number, golang

description:

17. Letter Combinations of a Phone Number
Medium
2969
357
Add to List
Share

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.

code:

func letterCombinations(digits string) []string {
    //use "len" to get count of digits's bytes, because it only contains digit(2 - 9)
    //judge the parameters
    nLen := len(digits)
    if 0 == nLen {
        return []string{}
    }
    
    //define char table for scanning and combining
    charTable := [10]string{"", "", "abc", "def", "ghi", "jkl", "mno", "pqrs", "tuv", "wxyz"}
    
    //fmt.Printf("charTable:%v\n, digits:%s\n", charTable, digits)
    
    //recurive to get the string which will use to return
    getString := func(digits string, charTable [10]string, nLevel int, strOut string, astrRet *[]string){}
    getString = func (digits string, charTable [10]string, nLevel int, strOut string, astrRet *[]string) {
        //fmt.Printf("nLevel:%d, strOut:%s, len(digits):%d\n", nLevel, strOut, len(digits))
        if nLevel == len(digits) {
            *astrRet = append(*astrRet, strOut)
            return
        }
        
        for _, v := range charTable[digits[nLevel] - '0'] {
            getString(digits, charTable, nLevel + 1, strOut + string(v), astrRet)
        }
    }//getString = func (digits string, charTable [10]string, nLevel int, strOut string, astrRet []string)
    
    astrRet := []string{}
    getString(digits, charTable, 0, "", &astrRet)
    
    return astrRet
}

result:

personal opinion:
notice slice when writting codes by using golang !!!