(c#)斐波那契数列

1.递归会造成栈溢出

2.使用尾递归或者迭代，迭代最好

 class Solution
    {
        //尾递归
        //public static int Fibonacci(int n)
        //{
        //    return Fibonacci(n, 0, 1);
        //}
        //private static int Fibonacci(int n, int acc1, int acc2)
        //{
        //    if (n == 0) return acc1;
        //    else return Fibonacci(n - 1, acc2, acc1 + acc2);
        //}

        //迭代
        private static int Fibonacci(int n)
        {
            if (n < 2) return n;
            int num1 = 0, num2 = 1;
            int currentnum = 0;
            for (int i = 2; i <= n; i++)
            {
                currentnum = num1 + num2;
                num1 = num2;
                num2 = currentnum;
            }
            return currentnum;
        }
        static void Main(string[] args)
        {
            Console.Write(Fibonacci(4));
        }
    }