给定一个仅包含数字 2-9 的字符串,返回所有它能表示的字母组合。答案可以按 任意顺序 返回。
给出数字到字母的映射如下(与电话按键相同)。注意 1 不对应任何字母
var hashMap = map[string]string{
"2": "abc",
"3": "def",
"4": "ghi",
"5": "jkl",
"6": "mno",
"7": "pqrs",
"8": "tuv",
"9": "wxyz",
}
var combinations []string
func letterCombinations(digits string) []string {
if len(digits) == 0 {
return []string{}
}
combinations = []string{}
var def func(digits string, index int, combination string)
def = func(digits string, index int, combination string) {
if index == len(digits) {
combinations = append(combinations, combination)
return
} else {
digit := digits[index]
letters := hashMap[string(digit)]
length := len(letters)
for i := 0; i < length; i++ {
def(digits, index+1, combination+string(letters[i]))
}
}
}
def(digits, 0, "")
return combinations
}