斐波那契数列
class Solution {
public int climbStairs(int n) {
if (n == 0) {
return 0;
}
if (n == 1) {
return 1;
}
int first = 1;
int second = 2;
int temp = 0;
for (int i = 3; i <= n; i++) {
temp = first + second;
first = second;
second = temp;
}
return second;
}
}