斐波那契数列
斐波那契数列:1, 1, 2, 3, 5, 8, 13, 21, 34, 55, 89, 144, ...
如果设F(n)为该数列的第n项(n∈N*),那么这句话可以写成如下形式::F(n)=F(n-1)+F(n-2)
一:循环
private int GetNumber1(int code1){
int a = 0;int b = 1;int sum=0;
for (int i = 2; i < code1; i++)
{
sum = a + b;
a = b;
b = sum;
}
return sum;
}
二:递归
private int GetNumber(int code)
{
if (code == 0)
{
return 0;
}
if (code == 1)
{
return 1;
}
else
{
return GetNumber(code - 1) + GetNumber(code - 2);
}
}