mirror of
https://github.com/krahets/hello-algo.git
synced 2026-11-02 19:25:19 +08:00
Yudong Jin
7257641e0e
* Retranslate the complete Japanese online edition from Chinese * Fit Japanese homepage labels and localize heading permalinks * Point Japanese contribution instructions to the Japanese preview * Replace locale conditionals with multilingual UI tables
50 lines
1.2 KiB
C++
50 lines
1.2 KiB
C++
/**
|
|
* File: climbing_stairs_dp.cpp
|
|
* Created Time: 2023-06-30
|
|
* Author: krahets ([email protected])
|
|
*/
|
|
|
|
#include "../utils/common.hpp"
|
|
|
|
/* 階段の上り方：動的計画法 */
|
|
int climbingStairsDP(int n) {
|
|
if (n == 1 || n == 2)
|
|
return n;
|
|
// 部分問題の解を格納する dp テーブルを初期化する
|
|
vector<int> dp(n + 1);
|
|
// 初期状態：最小の部分問題の解を設定する
|
|
dp[1] = 1;
|
|
dp[2] = 2;
|
|
// 状態遷移：小さな部分問題から順に大きな部分問題を解く
|
|
for (int i = 3; i <= n; i++) {
|
|
dp[i] = dp[i - 1] + dp[i - 2];
|
|
}
|
|
return dp[n];
|
|
}
|
|
|
|
/* 階段の上り方：空間を最適化した動的計画法 */
|
|
int climbingStairsDPComp(int n) {
|
|
if (n == 1 || n == 2)
|
|
return n;
|
|
int a = 1, b = 2;
|
|
for (int i = 3; i <= n; i++) {
|
|
int tmp = b;
|
|
b = a + b;
|
|
a = tmp;
|
|
}
|
|
return b;
|
|
}
|
|
|
|
/* 実行用コード */
|
|
int main() {
|
|
int n = 9;
|
|
|
|
int res = climbingStairsDP(n);
|
|
cout << "上る段数： " << n << " 段、上り方は全部で " << res << " 通り" << endl;
|
|
|
|
res = climbingStairsDPComp(n);
|
|
cout << "上る段数： " << n << " 段、上り方は全部で " << res << " 通り" << endl;
|
|
|
|
return 0;
|
|
}
|