mirror of
https://github.com/krahets/hello-algo.git
synced 2024-12-26 16:06:29 +08:00
32 lines
624 B
C
32 lines
624 B
C
|
/**
|
||
|
|
* File: climbing_stairs_dfs.c
|
||
|
|
* Created Time: 2023-09-19
|
||
|
|
* Author: huawuque404 (huawuque404@163.com)
|
||
|
|
*/
|
||
|
|
|
||
|
|
#include "../utils/common.h"
|
||
|
|
|
||
|
|
/* 搜索 */
|
||
|
|
int dfs(int i) {
|
||
|
|
// 已知 dp[1] 和 dp[2] ，返回之
|
||
|
|
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;
|
||
|
|
}
|
||
|
|
|
||
|
|
/* 爬楼梯：搜索 */
|
||
|
|
int climbingStairsDFS(int n) {
|
||
|
|
return dfs(n);
|
||
|
|
}
|
||
|
|
|
||
|
|
/* Driver Code */
|
||
|
|
int main() {
|
||
|
|
int n = 9;
|
||
|
|
|
||
|
|
int res = climbingStairsDFS(n);
|
||
|
|
printf("爬 %d 阶楼梯共有 %d 种方案\n", n, res);
|
||
|
|
|
||
|
|
return 0;
|
||
|
|
}
|