509. Fibonacci Number

Easy

Math,Dynamic Programming,Recursion,Memoization

---

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: n = 2
Output: 1
Explanation: F(2) = F(1) + F(0) = 1 + 0 = 1.

Example 2:

Input: n = 3
Output: 2
Explanation: F(3) = F(2) + F(1) = 1 + 1 = 2.

Example 3:

Input: n = 4
Output: 3
Explanation: F(4) = F(3) + F(2) = 2 + 1 = 3.

 

Constraints:

• 0 <= n <= 30

---

Submissions

Time Submitted	Status	Runtime	Memory	Language
07/06/2022 15:21	Accepted	0 ms	6 MB	cpp
07/06/2022 15:19	Accepted	24 ms	5.9 MB	cpp
10/09/2021 10:34	Accepted	0 ms	6 MB	cpp
09/23/2021 13:09	Accepted	0 ms	6 MB	cpp
09/23/2021 13:09	Runtime Error	N/A	N/A	cpp
09/23/2021 13:08	Runtime Error	N/A	N/A	cpp
09/23/2021 13:07	Wrong Answer	N/A	N/A	cpp
09/23/2021 13:06	Runtime Error	N/A	N/A	cpp