class Solution {public int climbStairs(int n) {if(n==0||n==1){return n;}//确定dp数组int[] dp = new int[n+1];//dp数组初始化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];}
}