mirror of
https://github.com/krahets/hello-algo.git
synced 2026-06-28 16:44:22 +00:00
Yudong Jin
2778a6f9c7
* Review the EN heading format. * Fix pythontutor headings. * Fix pythontutor headings. * bug fixes * Fix headings in **/summary.md * Revisit the CN-to-EN translation for Python code using Claude-4.5 * Revisit the CN-to-EN translation for Java code using Claude-4.5 * Revisit the CN-to-EN translation for Cpp code using Claude-4.5. * Fix the dictionary. * Fix cpp code translation for the multipart strings. * Translate Go code to English. * Update workflows to test EN code. * Add EN translation for C. * Add EN translation for CSharp. * Add EN translation for Swift. * Trigger the CI check. * Revert. * Update en/hash_map.md * Add the EN version of Dart code. * Add the EN version of Kotlin code. * Add missing code files. * Add the EN version of JavaScript code. * Add the EN version of TypeScript code. * Fix the workflows. * Add the EN version of Ruby code. * Add the EN version of Rust code. * Update the CI check for the English version code. * Update Python CI check. * Fix cmakelists for en/C code. * Fix Ruby comments
29 lines
546 B
Python
29 lines
546 B
Python
"""
|
|
File: climbing_stairs_dfs.py
|
|
Created Time: 2023-06-30
|
|
Author: krahets (krahets@163.com)
|
|
"""
|
|
|
|
|
|
def dfs(i: int) -> int:
|
|
"""Search"""
|
|
# Known dp[1] and dp[2], return them
|
|
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:
|
|
"""Climbing stairs: Search"""
|
|
return dfs(n)
|
|
|
|
|
|
"""Driver Code"""
|
|
if __name__ == "__main__":
|
|
n = 9
|
|
|
|
res = climbing_stairs_dfs(n)
|
|
print(f"Climbing {n} stairs has {res} solutions")
|