题目:
现在要求输入一个整数n,请你输出斐波那契数列的第n项(从0开始,第0项为0)。n<=39
分析:
1,1,2,3,5,8,13,……
a = 0, b = 0
(1),若n=0:
返回0
(2)若n<=2:
返回1
(3)若n>2:
返回a,b更新后的b.
代码实现:
public class Solution {
public int Fibonacci(int n) {
int res = 0;
int a = 1;
int b = 1;
if(n==0){
return 0;
}else if(n <= 2){
return 1;
}else{
for(int i = 0; i < n-2; i++){
int tmp = a;
a = b;
b = tmp+a;
}
return b;
}
}
}