mirror of
https://github.com/krahets/hello-algo.git
synced 2024-12-26 13:06:28 +08:00
33 lines
618 B
C++
33 lines
618 B
C++
|
/**
|
||
|
|
* File: climbing_stairs_dfs.cpp
|
||
|
|
* Created Time: 2023-06-30
|
||
|
|
* Author: krahets (krahets@163.com)
|
||
|
|
*/
|
||
|
|
|
||
|
|
#include "../utils/common.hpp"
|
||
|
|
|
||
|
|
/* Search */
|
||
|
|
int dfs(int i) {
|
||
|
|
// Known dp[1] and dp[2], return them
|
||
|
|
if (i == 1 || i == 2)
|
||
|
|
return i;
|
||
|
|
// dp[i] = dp[i-1] + dp[i-2]
|
||
|
|
int count = dfs(i - 1) + dfs(i - 2);
|
||
|
|
return count;
|
||
|
|
}
|
||
|
|
|
||
|
|
/* Climbing stairs: Search */
|
||
|
|
int climbingStairsDFS(int n) {
|
||
|
|
return dfs(n);
|
||
|
|
}
|
||
|
|
|
||
|
|
/* Driver Code */
|
||
|
|
int main() {
|
||
|
|
int n = 9;
|
||
|
|
|
||
|
|
int res = climbingStairsDFS(n);
|
||
|
|
cout << "There are " << res << " solutions to climb " << n << " stairs" << endl;
|
||
|
|
|
||
|
|
return 0;
|
||
|
|
}
|