// 猴子爬山
function funJump(n) { // 方法一:动态规划
if (n == 1 || n == 2) {
return 1;
} else if (n == 3) {
return 2;
} else if (n > 3) {
return funJump(n - 1) + funJump(n - 3);
}
}
console.log(funJump(50));
console.log(funJump(3));
let total = 0;
function dfsJump(cur, n) { // 方法二:深度优先搜索
if (cur == n) {
total++;
} else if (cur > n) {
return 0;
}
dfsJump(cur + 1, n);
dfsJump(cur + 3, n);
}
dfsJump(0, 50);
console.log(total);
猴子爬山-前端算法题
最新推荐文章于 2024-01-29 08:09:38 发布