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?

Note: Given n will be a positive integer.

问题分析：

1.当n=0时，一共有1种方法；当n=1时，一共有1种方法；

2.当n>=2时，一共拥有dp[n] = dp[n - 1] + dp[n - 2]中方法(dp[i]表示到第i个楼梯一共有dp[i]种走法)。

过程详见代码：

class Solution {
public:
    int climbStairs(int n) {
        int* dp = new int[n + 1];
        dp[0] = dp[1] = 1;
        for(int i = 2;i <= n; i++)
        {
        	dp[i] = dp[i - 1] + dp[i - 2];
		}
		int res = dp[n];
		delete []dp;
		return res;
    }
};