mirror of
https://github.com/krahets/hello-algo.git
synced 2024-12-26 23:16:28 +08:00
70784a1ec3
* feat(chapter_dynamic_programming): Add js and ts codes for chapter 14.1 * style(chapter_dynamic_programming): format code * refactor(chapter_dynamic_programming): remove main definition and add type * feat(chapter_backtracking): Add js and ts codes for chapter 13.3 * feat(chapter_divide_and_conquer): Add js and ts codes for chapter 12.2 * feat(chapter_divide_and_conquer): Add js and ts codes for chapter 12.3 * feat(chapter_divide_and_conquer): Add js and ts codes for chapter 12.4 * style(chapter_divide_and_conquer): fix typo * refactor: Use === instead of == in js and ts
24 lines
525 B
JavaScript
24 lines
525 B
JavaScript
/**
|
|
* File: climbing_stairs_dfs.js
|
|
* Created Time: 2023-07-26
|
|
* Author: yuan0221 (yl1452491917@gmail.com)
|
|
*/
|
|
|
|
/* 搜索 */
|
|
function dfs(i) {
|
|
// 已知 dp[1] 和 dp[2] ，返回之
|
|
if (i === 1 || i === 2) return i;
|
|
// dp[i] = dp[i-1] + dp[i-2]
|
|
const count = dfs(i - 1) + dfs(i - 2);
|
|
return count;
|
|
}
|
|
|
|
/* 爬楼梯：搜索 */
|
|
function climbingStairsDFS(n) {
|
|
return dfs(n);
|
|
}
|
|
|
|
/* Driver Code */
|
|
const n = 9;
|
|
const res = climbingStairsDFS(n);
|
|
console.log(`爬 ${n} 阶楼梯共有 ${res} 种方案`);
|