220. Fibonacci Quest — First N Numbers

Easy · Math

The Fibonacci sequence is 1, 1, 2, 3, 5, 8, 13… each number is the sum of the two before it. Return an array of the first `n` Fibonacci numbers.

Examples

Example 1
Input: n=7
Output: [1,1,2,3,5,8,13]
Explanation: First 7 Fibonacci numbers

Constraints

• 1 ≤ n ≤ 30