You can not select more than 25 topics
Topics must start with a letter or number, can include dashes ('-') and can be up to 35 characters long.
29 lines
542 B
29 lines
542 B
8 months ago
|
"""
|
||
|
|
File: climbing_stairs_dfs.py
|
||
|
|
Created Time: 2023-06-30
|
||
|
|
Author: krahets (krahets@163.com)
|
||
|
|
"""
|
||
|
|
|
||
|
|
|
||
|
|
def dfs(i: int) -> int:
|
||
|
|
"""搜尋"""
|
||
|
|
# 已知 dp[1] 和 dp[2] ，返回之
|
||
|
|
if i == 1 or i == 2:
|
||
|
|
return i
|
||
|
|
# dp[i] = dp[i-1] + dp[i-2]
|
||
|
|
count = dfs(i - 1) + dfs(i - 2)
|
||
|
|
return count
|
||
|
|
|
||
|
|
|
||
|
|
def climbing_stairs_dfs(n: int) -> int:
|
||
|
|
"""爬樓梯：搜尋"""
|
||
|
|
return dfs(n)
|
||
|
|
|
||
|
|
|
||
|
|
"""Driver Code"""
|
||
|
|
if __name__ == "__main__":
|
||
|
|
n = 9
|
||
|
|
|
||
|
|
res = climbing_stairs_dfs(n)
|
||
|
|
print(f"爬 {n} 階樓梯共有 {res} 種方案")
|