class Solution {
public int climbStairs(int n) {
int[] dp = new int[n+1];
if(n <= 0 ){
return 0;
}
if(n == 1 || n == 2){
return n;
}
dp[1] = 1;
dp[2] = 2;
for (int i = 3; i <= n; i++) {
dp[i] = dp[i-1] + dp[i-2];
}
return dp[n];
}
}
70. 爬楼梯
最新推荐文章于 2023-03-27 20:20:31 发布