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?
分析:最简单的一维动态规划,可以使用递归或迭代。迭代很容易写出来,其中递推关系式为 dp[i] = dp[i - 1] + dp[i - 2];
class Solution {
int dp[100];
public:
int climbStairs(int n) {
if(n == 0 || n == 1) return n;
dp[0] = 1;dp[1] = 2;
for(int i = 2; i < n; i++) {
dp[i] = dp[i - 1] + dp[i - 2];
}
return dp[n - 1];
}
};