题目描述
大家都知道斐波那契数列,现在要求输入一个整数n,请你输出斐波那契数列的第n项(从0开始,第0项为0)。
n<=39
public class Solution {
public int Fibonacci(int n) {
if (n <= 1) {
return n;
}
int one = 0, two = 1;
for (int i = 2; i <= n; i++) {
two = one + two;
one = two - one;
}
return two;
}
}