Climbing Stairs

You are climbing a stair case. It takes n steps to reach to the top.

Each time you can either climb 1 or 2 steps. In how many distinct ways can you climb to the top?

Tags

DP

----------------------------------------------------------------------------------------------------------------------------------------------------------------------------

Rules

f
= f[n-1] + f[n-2];

/**
* @param {number} n
* @return {number}
*/
var climbStairs = function (n) {
var ret = [];
ret[0] = 0;
ret[1] = 1;
ret[2] = 2;

for (var i = 3; i <= n; i++) {
ret[i] = ret[i - 1] + ret[i - 2];
}

return ret
;
};