0, 1, 1, 2, 3, 5, 8, 13, 21, 34, 55, 89, 144, …
public static int Fibonacci(int n)
{
if (n < 0) return -1;
if (n == 0) return 0;
if (n == 1) return 1;
return Fibonacci(n - 1) + Fibonacci(n - 2);
}
0, 1, 1, 2, 3, 5, 8, 13, 21, 34, 55, 89, 144, …
public static int Fibonacci(int n)
{
if (n < 0) return -1;
if (n == 0) return 0;
if (n == 1) return 1;
return Fibonacci(n - 1) + Fibonacci(n - 2);
}