//简单递归的方法计算斐波那契数列
static long recurFib(int n)
{
if (n < 2)
{
return n;
}
else
return recurFib(n - 1) + recurFib(n - 2);
}
//动态规划,将之前运算过的数字记录下来 计算斐波那契数列
static long iterFib(int n)
{
n = n + 1;
int[] val = new int[n];
if (n < 2)
{
return 1;
}
else
{
val[0] = 0;
val[1] = 1;
for (int i = 2; i <= n - 1; i++)
{
val[i] = val[i - 1] + val[i - 2];
}
return val[n-1];
}
}
//动态规划将之前 前两个数字记录下来 计算斐波那契数列
static long Fib(int n)
{
long last;
long nextlast;
long result;
last = 0;
nextlast = 1;
result = 1;
for (int i = 0; i <= n - 1; i++)
{
result = last + nextlast;
nextlast = last;
last = result;
}
return result;
}
static long recurFib(int n)
{
if (n < 2)
{
return n;
}
else
return recurFib(n - 1) + recurFib(n - 2);
}
//动态规划,将之前运算过的数字记录下来 计算斐波那契数列
static long iterFib(int n)
{
n = n + 1;
int[] val = new int[n];
if (n < 2)
{
return 1;
}
else
{
val[0] = 0;
val[1] = 1;
for (int i = 2; i <= n - 1; i++)
{
val[i] = val[i - 1] + val[i - 2];
}
return val[n-1];
}
}
//动态规划将之前 前两个数字记录下来 计算斐波那契数列
static long Fib(int n)
{
long last;
long nextlast;
long result;
last = 0;
nextlast = 1;
result = 1;
for (int i = 0; i <= n - 1; i++)
{
result = last + nextlast;
nextlast = last;
last = result;
}
return result;
}