斐波那契数列,黄金分割数列两种方式

public static int Fibonacci(int num)
{
    if (num > 0 && num <= 2)
        return 1;
    return Fibonacci(num - 1) + Fibonacci(num - 2);
}

public int Fibonacci(int num)
{
    if (num > 0 && num <= 2)
        return 1;
    // 设定f1代表第num-2个数，f2代表第num-1; current代表第num个斐波那契队列所对应的数。
    int f1 = 1, f2 = 1, current = 0;
    for (int i = 3; i <= num; i++)
    {
        current = f1 + f2;
        f1 = f2;
        f2 = current;
    }
    return current;
}