mirror of
https://github.com/krahets/hello-algo.git
synced 2026-06-28 08:34:28 +00:00
Ikko Eltociear Ashimine
954c45864b
* docs: add Japanese documents (`ja/docs`) * docs: add Japanese documents (`ja/codes`) * docs: add Japanese documents * Remove pythontutor blocks in ja/ * Add an empty at the end of each markdown file. * Add the missing figures (use the English version temporarily). * Add index.md for Japanese version. * Add index.html for Japanese version. * Add missing index.assets * Fix backtracking_algorithm.md for Japanese version. * Add avatar_eltociear.jpg. Fix image links on the Japanese landing page. * Add the Japanese banner. --------- Co-authored-by: krahets <krahets@163.com>
40 lines
1.1 KiB
Python
40 lines
1.1 KiB
Python
"""
|
|
File: climbing_stairs_dp.py
|
|
Created Time: 2023-06-30
|
|
Author: krahets (krahets@163.com)
|
|
"""
|
|
|
|
|
|
def climbing_stairs_dp(n: int) -> int:
|
|
"""階段登り：動的プログラミング"""
|
|
if n == 1 or n == 2:
|
|
return n
|
|
# dp テーブルを初期化、部分問題の解を格納するため使用
|
|
dp = [0] * (n + 1)
|
|
# 初期状態：最小の部分問題の解を事前設定
|
|
dp[1], dp[2] = 1, 2
|
|
# 状態遷移：小さい部分問題から大きい部分問題を段階的に解く
|
|
for i in range(3, n + 1):
|
|
dp[i] = dp[i - 1] + dp[i - 2]
|
|
return dp[n]
|
|
|
|
|
|
def climbing_stairs_dp_comp(n: int) -> int:
|
|
"""階段登り：空間最適化動的プログラミング"""
|
|
if n == 1 or n == 2:
|
|
return n
|
|
a, b = 1, 2
|
|
for _ in range(3, n + 1):
|
|
a, b = b, a + b
|
|
return b
|
|
|
|
|
|
"""ドライバーコード"""
|
|
if __name__ == "__main__":
|
|
n = 9
|
|
|
|
res = climbing_stairs_dp(n)
|
|
print(f"{n} 段登り、合計 {res} 通りの解がある")
|
|
|
|
res = climbing_stairs_dp_comp(n)
|
|
print(f"{n} 段登り、合計 {res} 通りの解がある") |