public int climbStairs(int n) {
if (n <= 0) return 0;
if (n == 1) return 1;
if (n == 2) return 2;
int prevPrev = 1;
int prev = 2;
int curr = 0;
for (int i = 3; i <= n; i++) {
curr = prev + prevPrev;
prevPrev = prev;
prev = curr;
}
return curr;
}
70. Climbing Stairs
最新推荐文章于 2022-03-21 15:59:21 发布