Fibonacci Number
Medium
recursion
dynamic-programming
math
Fibonacci Number
The Fibonacci numbers are: 0, 1, 1, 2, 3, 5, 8, 13, 21, 34, ...
Given n, calculate F(n).
Example 1
Input: 5
Output: 5
Explanation: F(5) = F(4) + F(3) = 3 + 2 = 5
Example 2
Input: 10
Output: 55
Constraints
- 0 ≤ n ≤ 30
示例测试用例
示例 1
输入:
(none)
预期输出:
0
示例 2
输入:
1
预期输出:
1
示例 3
输入:
5
预期输出:
5
快捷键:
- • Ctrl/Cmd + Enter 提交
📈 统计
提交次数
0
通过次数
0