hello-algo/codes/swift/chapter_dynamic_programming/climbing_stairs_dfs.swift

33 lines
624 B
Swift
Raw Permalink Normal View History

/**
* File: climbing_stairs_dfs.swift
* Created Time: 2023-07-15
* Author: nuomi1 (nuomi1@qq.com)
*/
/* */
func dfs(i: Int) -> Int {
// dp[1] dp[2]
if i == 1 || i == 2 {
return i
}
// dp[i] = dp[i-1] + dp[i-2]
let count = dfs(i: i - 1) + dfs(i: i - 2)
return count
}
/* */
func climbingStairsDFS(n: Int) -> Int {
dfs(i: n)
}
@main
enum ClimbingStairsDFS {
/* Driver Code */
static func main() {
let n = 9
let res = climbingStairsDFS(n: n)
print("\(n) 阶楼梯共有 \(res) 种方案")
}
}