解题思路:
找规律:当前台阶方法 = 前一台阶方法 + 前两台阶方法, i = (i - 1) + (i - 2)
答案:
/**
* @param {number} n
* @return {number}
*/
let climbStairs = function (n) {
let one = 1;
let two = 2;
if (n == 1) {
return one;
} else if (n == 2) {
return two;
} else {
for (let i = 3; i < n + 1; i++) {
three = one + two;
one = two;
two = three;
}
return two;
}
};