Given a string containing digits from 2-9 inclusive, return all possible letter combinations that the number could represent. Return the answer in any order.
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 1:
Input: digits = "23"
Output: ["ad","ae","af","bd","be","bf","cd","ce","cf"]
Example 2:
Input: digits = ""
Output: []
Example 3:
Input: digits = "2"
Output: ["a","b","c"]
Constraints:
0 <= digits.length <= 4digits[i]is a digit in the range['2', '9'].
假設給一個數字對應到字元的方式，如同手機按鍵一樣
2 -> a, b, c 3 -> d, e, f
...
要求寫一個演算法來從給定的一個數字組成的字串找出所可能透過上面對應方式組出的字串
首先要能知道如何去做窮舉
一個可行的方式是把每個數字對應到一個字串 , 而該字串是由所有可能字元串接而成
這樣每次在於到該數字時，就可以透過字串位置來逐步找到該可能字元
然後把每個數字字元逐步找對應
方式如下
package sol
var digitMap = map[byte]string{
'2': "abc",
'3': "def",
'4': "ghi",
'5': "jkl",
'6': "mno",
'7': "pqrs",
'8': "tuv",
'9': "wxyz",
}
func letterCombinations(digits string) []string {
if len(digits) == 0 {
return []string{}
}
result := []string{}
var dfs func(i int, cur []byte)
dfs = func(i int, cur []byte) {
if i == len(digits) {
temp := make([]byte, len(cur))
copy(temp, cur)
result = append(result, string(temp))
return
}
search := digitMap[digits[i]]
sLen := len(search)
for idx := 0; idx < sLen; idx++ {
cur = append(cur, search[idx])
dfs(i+1, cur)
cur = cur[:len(cur)-1]
}
}
dfs(0, []byte{})
return result
}- 需要找到窮舉的方式
- 想到讓數字對應字元的資料結構
- Understand what problem need to solve
- Analysis Complexity