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?
题目解析:第n个台阶只可能两种方式达到,从n-1阶走一步和n-2阶走两步,用动态规划f(n) = f(n - 1) + f(n - 2)
int climbStairs(int n) {
int* step = (int*)malloc((n + 1) * sizeof(int));
step[0] = 1;
step[1] = 1;
step[2] = 2;
if (n <= 0) return 0;
if (n == 1) return 1;
for (int i = 2; i <= n; ++i) step[i] = step[i - 1] + step[i - 2];
return step[n];
}