70. Climbing Stairs Add to List

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?

Subscribe to see which companies asked this question

///////////233333333一看题有点动态规划和组合的概念

///////////斐波那契数列

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