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