[Amazon] Program for Fibonacci numbers 斐波那契数列

The Fibonacci numbers are the numbers in the following integer sequence.

0, 1, 1, 2, 3, 5, 8, 13, 21, 34, 55, 89, 144, ……..

In mathematical terms, the sequence Fn of Fibonacci numbers is defined by the recurrence relation

Fn = Fn-1 + Fn-2
with seed values

F0 = 0 and F1 = 1.

参考：  斐波那契数列

Java: Fibonacci Series using Recursionclass fibonacci

class fibonacci
{
    static int fib(int n)
    {
        if (n <= 1)
           return n;
        return fib(n-1) + fib(n-2);
    }
}　

Python:

def Fibonacci(n):
    if n<0:
        print("Incorrect input")
    # First Fibonacci number is 0
    elif n==1:
        return 0
    # Second Fibonacci number is 1
    elif n==2:
        return 1
    else:
        return Fibonacci(n-1)+Fibonacci(n-2)

 

类似题目：

[LeetCode] 70. Climbing Stairs 爬楼梯　　

　　

 

转载于:https://www.cnblogs.com/lightwindy/p/8621249.html