class Solution {
public int climbStairs(int n) {
if(n <= 2)
return n;
int[] climb = new int[n];
climb[0] = 1;climb[1] = 2;
for(int i = 2;i < n;i++)
climb[i] = climb[i - 2] + climb[i - 1];
return climb[n-1];
}
}
leetcode70. 爬楼梯
最新推荐文章于 2024-09-14 22:25:23 发布