Climbing stairs

 1 public class Solution {
 2     public int climbStairs(int n) 
 3     {
 4         int[] count = new int[n+1];
 5         if(n<=1)return n;
 6         count[0]=1;   //注意这个得赋值为1，之后才可以正常运行
 7         count[1]=1;
 8         
 9         for(int i=2;i<=n;i++)
10            {
11                count[i]=count[i-1]+count[i-2];
12            }
13            
14         return count[n];
15         
16     }
17 }