mirror of
https://github.com/krahets/hello-algo.git
synced 2024-12-26 11:26:29 +08:00
e720aa2d24
* Sync recent changes to the revised Word. * Revised the preface chapter * Revised the introduction chapter * Revised the computation complexity chapter * Revised the chapter data structure * Revised the chapter array and linked list * Revised the chapter stack and queue * Revised the chapter hashing * Revised the chapter tree * Revised the chapter heap * Revised the chapter graph * Revised the chapter searching * Reivised the sorting chapter * Revised the divide and conquer chapter * Revised the chapter backtacking * Revised the DP chapter * Revised the greedy chapter * Revised the appendix chapter * Revised the preface chapter doubly * Revised the figures
42 lines
1.1 KiB
Swift
42 lines
1.1 KiB
Swift
/**
|
||
* File: climbing_stairs_backtrack.swift
|
||
* Created Time: 2023-07-15
|
||
* Author: nuomi1 (nuomi1@qq.com)
|
||
*/
|
||
|
||
/* 回溯 */
|
||
func backtrack(choices: [Int], state: Int, n: Int, res: inout [Int]) {
|
||
// 当爬到第 n 阶时，方案数量加 1
|
||
if state == n {
|
||
res[0] += 1
|
||
}
|
||
// 遍历所有选择
|
||
for choice in choices {
|
||
// 剪枝：不允许越过第 n 阶
|
||
if state + choice > n {
|
||
continue
|
||
}
|
||
backtrack(choices: choices, state: state + choice, n: n, res: &res)
|
||
}
|
||
}
|
||
|
||
/* 爬楼梯：回溯 */
|
||
func climbingStairsBacktrack(n: Int) -> Int {
|
||
let choices = [1, 2] // 可选择向上爬 1 阶或 2 阶
|
||
let state = 0 // 从第 0 阶开始爬
|
||
var res: [Int] = []
|
||
res.append(0) // 使用 res[0] 记录方案数量
|
||
backtrack(choices: choices, state: state, n: n, res: &res)
|
||
return res[0]
|
||
}
|
||
|
||
@main
|
||
enum ClimbingStairsBacktrack {
|
||
/* Driver Code */
|
||
static func main() {
|
||
let n = 9
|
||
|
||
let res = climbingStairsBacktrack(n: n)
|
||
print("爬 \(n) 阶楼梯共有 \(res) 种方案")
|
||
}
|
||
}
|