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. 1 step + 1 step
2. 2 steps

Example 2:

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

题意：有n阶楼梯， 每次可以爬1层或2层，总有多少种走法。

方法一：动态规划，状态转移方程是 count[i] = count[i-1] + count[i-2];  count[i]表示i个台阶有多少种走法。

class Solution {
public:
    int climbStairs(int n) {
         if(n<=2)
          return n;

        vector<int> count(n);
        count[0] =1;
        count[1] =2;
        
        for(int i=2;i<n;i++)
        {
          count[i] = count[i-1] + count[i-2];
        }      
        return  count[n-1];
    }
};