题目
代码部分一(4ms 27.36%)
class Solution {
public int climbStairs(int n) {
int i = 1, j = 1;
while(n > 1){
i += j;
j = i - j;
n--;
}
return i;
}
}
代码部分二(3ms 91.33%)
class Solution {
public int climbStairs(int n) {
int[] a = new int[n + 1];
a[0] = 0;
if(n > 0) a[1] = 1;
if(n > 1) a[2] = 2;
if(n >= 3){
for(int i = 3; i < a.length; i++){
a[i] = a[i - 1] + a[i - 2];
}
}
return a[n];
}
}