【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.

package main
import(
	"strconv"
	"fmt"
)
func letterCombinations(digits string) []string {
	var result []string
	if digits == ""{
		return result
	}
	dict := map[int]string{2:"abc",3:"def",4:"ghi",5:"jkl",6:"mno",7:"pqrs",8:"tuv",9:"wxyz"}
	length := len(digits)
	i := 0
	for i<length {
		current,_ := strconv.Atoi(string(digits[i]))
		if len(result)==0{
			for _, v:= range dict[current]{
				result = append(result, string(v))
			}
		}else{
			currlen := len(result)
			for j:=0; j < currlen; j++{
				for _, char := range dict[current]{
					result = append(result,result[j]+string(char))
				}
			}
			result = result[currlen:len(result)]
		}
		i++
	}
	return result
}
func main(){
	fmt.Println(letterCombinations("2345"))
}