Code
/// <summary>
/// 递归方法求裴波契那数列
/// </summary>
/// <param name="i">位数</param>
/// <returns>数字</returns>
public static int Foo(int i)
{
if (i < 0)
return 0;
else if (i > 0 && i <= 2)
return 1;
else
return Foo(i - 1) + Foo(i - 2);
}
/// <summary>
/// 递归方法求裴波契那数列
/// </summary>
/// <param name="i">位数</param>
/// <returns>数字</returns>
public static int Foo(int i)
{
if (i < 0)
return 0;
else if (i > 0 && i <= 2)
return 1;
else
return Foo(i - 1) + Foo(i - 2);
}