algorithm/leetcode-master
1
0
Fork 0
mirror of https://github.com/youngyangyang04/leetcode-master.git synced 2025-07-08 16:54:50 +08:00
Code Issues Packages Projects Releases Wiki Activity

0017.电话号码的字母组合：更新Swift实现

Browse Source
This commit is contained in:
bqlin
2021-12-11 23:34:11 +08:00
parent a1359e0f3b
commit dda0b20926
1 changed files with 3 additions and 3 deletions
Download Patch File Download Diff File Expand all files Collapse all files

6
problems/0017.电话号码的字母组合.md
View File

@ -503,7 +503,7 @@ func letterCombinations(_ digits: String) -> [String] {
var result = [String]() var result = [String]()
var s = "" var s = ""
func backtracking(digits: [Int], index: Int) { func backtracking(index: Int) {
// 结束条件：收集结果 // 结束条件：收集结果
if index == digits.count { if index == digits.count {
result.append(s) result.append(s)
@ -514,11 +514,11 @@ func letterCombinations(_ digits: String) -> [String] {
let letters = letterMap[digits[index]] let letters = letterMap[digits[index]]
for letter in letters { for letter in letters {
s.append(letter) // 处理 s.append(letter) // 处理
backtracking(digits: digits, index: index + 1) // 递归，记得+1 backtracking(index: index + 1) // 递归，记得+1
s.removeLast() // 回溯 s.removeLast() // 回溯
} }
} }
backtracking(digits: digits, index: 0) backtracking(index: 0)
return result return result
} }
``` ```