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

0077.组合、0077.组合优化：Swift实现减少参数

Browse Source
This commit is contained in:
bqlin
2021-12-18 18:45:54 +08:00
parent de0465b773
commit 90aa75c573
2 changed files with 10 additions and 10 deletions
Download Patch File Download Diff File Expand all files Collapse all files

10
problems/0077.组合.md
View File

@ -627,7 +627,7 @@ int** combine(int n, int k, int* returnSize, int** returnColumnSizes){
func combine(_ n: Int, _ k: Int) -> [[Int]] { func combine(_ n: Int, _ k: Int) -> [[Int]] {
var path = [Int]() var path = [Int]()
var result = [[Int]]() var result = [[Int]]()
func backtracking(_ n: Int, _ k: Int, _ startIndex: Int) { func backtracking(start: Int) {
// 结束条件，并收集结果 // 结束条件，并收集结果
if path.count == k { if path.count == k {
result.append(path) result.append(path)
@ -638,15 +638,15 @@ func combine(_ n: Int, _ k: Int) -> [[Int]] {
// let end = n // let end = n
// 剪枝优化 // 剪枝优化
let end = n - (k - path.count) + 1 let end = n - (k - path.count) + 1
guard startIndex <= end else { return } guard start <= end else { return }
for i in startIndex ... end { for i in start ... end {
path.append(i) // 处理结点 path.append(i) // 处理结点
backtracking(n, k, i + 1) // 递归 backtracking(start: i + 1) // 递归
path.removeLast() // 回溯 path.removeLast() // 回溯
} }
} }
backtracking(n, k, 1) backtracking(start: 1)
return result return result
} }
``` ```

10
problems/0077.组合优化.md
View File

@ -300,7 +300,7 @@ Swift：
func combine(_ n: Int, _ k: Int) -> [[Int]] { func combine(_ n: Int, _ k: Int) -> [[Int]] {
var path = [Int]() var path = [Int]()
var result = [[Int]]() var result = [[Int]]()
func backtracking(_ n: Int, _ k: Int, _ startIndex: Int) { func backtracking(start: Int) {
// 结束条件，并收集结果 // 结束条件，并收集结果
if path.count == k { if path.count == k {
result.append(path) result.append(path)
@ -311,15 +311,15 @@ func combine(_ n: Int, _ k: Int) -> [[Int]] {
// let end = n // let end = n
// 剪枝优化 // 剪枝优化
let end = n - (k - path.count) + 1 let end = n - (k - path.count) + 1
guard startIndex <= end else { return } guard start <= end else { return }
for i in startIndex ... end { for i in start ... end {
path.append(i) // 处理结点 path.append(i) // 处理结点
backtracking(n, k, i + 1) // 递归 backtracking(start: i + 1) // 递归
path.removeLast() // 回溯 path.removeLast() // 回溯
} }
} }
backtracking(n, k, 1) backtracking(start: 1)
return result return result
} }
``` ```