题目链接:https://leetcode.com/problems/climbing-stairs/#/description
题目要求:实质上是求斐波那契数列的值。f(1)=1, f(2)=2, f(3) = f(2)+f(1)...求f(n)
思路:采用求斐波那契数列的迭代算法。
Java代码如下:
public class Solution {
public int climbStairs(int n) {
if(n<=0){
return 0;
}
if(n==1){
return 1;
}
if(n==2){
return 2;
}
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;
}
}