递归算法，1,1,2,3,5,8....算出第N为是多少

static void Main(string[] args)
{

int[] cSum = new int[N];

for (int i = 0; i < cSum.Length; i++)
{
cSum[i] = Pro_WriteNum(i);
Console.WriteLine(cSum[i]);
}

Console.ReadLine();
}

private static int Pro_WriteNum(int T)
{
int result = 0;
if (T == 0 || T == 1)
{
result = 1;
}
else

{
result = Pro_WriteNum(T- 1) + Pro_WriteNum(T - 2);

}
return result;

}

转载于:https://www.cnblogs.com/dulang/p/6699091.html