Dynamic Programing -- Leetcode problem 70. 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.

Example 1:

Input: 2
Output: 2
Explanation: There are two ways to climb to the top.
- 1 step + 1 step
- 2 steps

Example 2:

Input: 3
Output: 3
Explanation: There are three ways to climb to the top.
- 1 step + 1 step + 1 step
- 1 step + 2 steps
- 2 steps + 1 step

• 描述：水题，找到上楼的所有可能情况。

• 思路一：动态规划，到达第n层有n-1和n-2种可能走法。

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