class Solution { //在这里采用的是自底而上的方法
public:
int Fibonacci(int n) {
int array[2] = {0,1};
if (n<2){
return array[n];
}
else{
long long one =0;
long long two =1;
long long sum =0;
for (long long i = 2;i<=n;i++){
sum = one + two;
one = two;
two = sum;
}
return sum;
}
}
};