class Solution {
public int climbStairs(int n) {
if (n == 1) return 1;
int[] f = new int[n + 1];
f[1] = 1;
f[2] = 2;
for (int i = 3; i <= n; i ++) {
f[i] = f[i - 1] + f[i - 2];
}
return f[n];
}
}
爬楼梯
最新推荐文章于 2024-09-30 14:51:11 发布