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?
Note: Given n will be a positive integer.
Subscribe to see which companies asked this question.
思路:最简单的动态规划了吧?
从1~n有小到大,w[i] = w[i-1] + w[i-2]
储存w
代码:
class Solution {
public:
int climbStairs(int n) {
if(n == 0)
return 0;
if(n == 1)
return 1;
if(n == 2)
return 2;
int ways[n+1] = {0};
ways[0] = 0;
ways[1] = 1;
ways[2] = 2;
for(int i = 3; i <= n ; i++)
{
ways[i] = ways[i-1] + ways[i-2];
}
return ways[n];
}
};