731 B
731 B
title, tags, expertise, firstSeen, lastUpdated
| title | tags | expertise | firstSeen | lastUpdated |
|---|---|---|---|---|
| Fibonacci | math,list | intermediate | 2018-10-06T06:06:33+03:00 | 2020-11-02T19:27:53+02:00 |
Generates a list, containing the Fibonacci sequence, up until the nth term.
- Starting with
0and1, uselist.append()to add the sum of the last two numbers of the list to the end of the list, until the length of the list reachesn. - If
nis less or equal to0, return a list containing0.
def fibonacci(n):
if n <= 0:
return [0]
sequence = [0, 1]
while len(sequence) <= n:
next_value = sequence[len(sequence) - 1] + sequence[len(sequence) - 2]
sequence.append(next_value)
return sequence
fibonacci(7) # [0, 1, 1, 2, 3, 5, 8, 13]