#include<iostream>
using namespace std;
long long Fibonacci(unsigned int n)//递归
{
if (n <= 0)
return 0;
if (n == 1)
return 1;
return Fibonacci(n - 1) + Fibonacci(n - 2);
}
long long Fibonacci1(unsigned int n)//非递归
{
int pre = 0;
int current = 1;
long long result;
if (n <= 0) return 0;
if (n == 1) return 1;
int i = 2;
while (i++ <= n)
{
result = pre + current;
pre = current;
current = result;
}
return result;
}