csharp 用于找到斐波纳契数列的迭代解的示例。从计算机编程基础与C＃http：//www.introprogr

Posted 2021-05-12

static void Main()
{
  Console.Write("n = ");
  int n = int.Parse(Console.ReadLine());
  
  long result = Fib(n);
  Console.WriteLine("fib({0}) = {1}", n, result);
}

static long Fib(int n)
{
  long fn = 0;
  long fnMinus1 = 1;
  long fnMinus2 = 1;
  
  for (int i = 2; i < n; i++)
  {
    fn = fnMinus1 + fnMinus2;
    fnMinus2 = fnMinus1;
    fnMinus1 = fn;
  }
  
  return fn;
}

//  n = 6
//  fib(6) = 8