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?

 

1 class Solution { 2 public: 3     int climbStairs(int n) { 4          5          6         int *step_count=new int[n+1]; 7         step_count[1]=1; 8         step_count[2]=2; 9         10         //动归方程11         for(int i=3;i