求斐波那契数列第n项

/// <summary>
/// 公式法求斐波那契数列
/// </summary>
public static int Fibonacci(int n)
{
    double sqr5 = Math.Sqrt(5) * 0.5;
    return (int)((Math.Pow(0.5 + sqr5, n) - Math.Pow(0.5 - sqr5, n)) / sqr5 * 0.5);
}

/// <summary>
/// 循环法求斐波那契数列
/// </summary>
public static int Fibonacci(int n)
{
    int a = 0, b = 1, i = n;
    for (; i > 0; i--)
    {
        b += a;// 等价于b=b+a
        a = b - a;
    }
    return a;
}