DESCRIPTION:
I love Fibonacci numbers in general, but I must admit I love some more than others.
I would like for you to write me a function that when given a number (n) returns the n-th number in the Fibonacci Sequence.
For example:
nth_fib(4) == 2
Because 2 is the 4th number in the Fibonacci Sequence.
For reference, the first two numbers in the Fibonacci sequence are 0 and 1, and each subsequent number is the sum of the previous two.
def nth_fib(n):
if n==1:
return 0
if n==2:
return 1
else:
#print(n+fib(n-1))
return nth_fib(n-1)+nth_fib(n-2)'알고리즘 문제 > CodeWar' 카테고리의 다른 글
| Calculating String Rotation (0) | 2022.11.02 |
|---|---|
| Coding Meetup #8 Will all continents be represented? (0) | 2022.11.02 |
| Srot the inner ctonnet in dsnnieedcg oredr (0) | 2022.11.01 |
| String array dupliciates (0) | 2022.11.01 |
| Difference of 2 (0) | 2022.11.01 |