var climbStairs = function(n) {
// 递归超时
// function f(n){
// if(n == 1 || n == 2)return n;
// return climbStairs[n - 1] + climbStairs[n - 2];
// }
let res = new Array(n+1);
res[1] = 1;
res[2] = 2;
for(let i = 3; i <= n; i++)res[i] = res[i - 1] + res[i - 2];
return res[n];
};
JS力扣刷题70. 爬楼梯
最新推荐文章于 2022-09-27 13:37:58 发布