[LeetCode]#509. Fibonacci Number

F(0) = 0, F(1) = 1
F(n) = F(n - 1) + F(n - 2), for n > 1.
Input: n = 2
Output: 1
Explanation: F(2) = F(1) + F(0) = 1 + 0 = 1.
  1. If n=0 and n=1, return n.
  2. If n>1, use recursive method and return f(n-1)+f(n-2)
class Solution:
def fib(self, n):
if n==0 or n==1:
return n
else:
return self.fib(n-1)+self.fib(n-2)

--

--

Get the Medium app

A button that says 'Download on the App Store', and if clicked it will lead you to the iOS App store
A button that says 'Get it on, Google Play', and if clicked it will lead you to the Google Play store