509. Fibonacci Number

最新推荐文章于 2024-04-18 16:35:33 发布

林下溪源

最新推荐文章于 2024-04-18 16:35:33 发布

阅读量129

点赞数

分类专栏： # Arrays LeetCode 文章标签： LeetCode 算法 Java

本文链接：https://blog.csdn.net/zzyy17/article/details/103220936

版权

LeetCode 同时被 2 个专栏收录

117 篇文章 0 订阅

订阅专栏

Arrays

79 篇文章 0 订阅

订阅专栏

Problem Description:

The Fibonacci numbers, commonly denoted F(n) form a sequence, called the Fibonacci sequence, such that each number is the sum of the two preceding ones, starting from 0 and 1. That is,
F(0) = 0,   F(1) = 1
F(N) = F(N - 1) + F(N - 2), for N > 1.
Given N, calculate F(N).

Example 1:
Input: 2
Output: 1
Explanation: F(2) = F(1) + F(0) = 1 + 0 = 1.
Example 2:
Input: 3
Output: 2
Explanation: F(3) = F(2) + F(1) = 1 + 1 = 2.
Example 3:
Input: 4
Output: 3
Explanation: F(4) = F(3) + F(2) = 2 + 1 = 3.
Note:

0 ≤ N ≤ 30.

Analysis:

本题使用递归方法。代码如下：

Code:

class Solution {
    public int fib(int N) {
        if(N == 0) return 0;
        if(N == 1) return 1;
        return fib(N - 1) + fib(N - 2);
    }
}