mathdatech/Python
1
0
Fork 0
mirror of https://github.com/TheAlgorithms/Python.git synced 2024-11-23 21:11:08 +00:00
Code Issues Packages Projects Releases Wiki Activity

Merge pull request #75 from alaouimehdi1995/master

Browse Source 
Fixing some terms number issue, and improving result for first terms (0 and 1)
This commit is contained in:
Chetan Kaushik 2017-04-13 11:27:24 +05:30 committed by GitHub
commit e268bf1b4d
1 changed files with 9 additions and 10 deletions
Show Stats Download Patch File Download Diff File Expand all files Collapse all files

19
dynamic_programming/fibonacci.py
View File

@ -6,25 +6,24 @@ This is a pure Python implementation of Dynamic Programming solution to the fibo
class Fibonacci:
def __init__(self, N=None):
self.fib_array = []
if N:
N = int(N)
self.fib_array = [0] * (N + 1)
self.fib_array[0] = 0
self.fib_array[1] = 1
self.fib_array.append(0)
self.fib_array.append(1)
for i in range(2, N + 1):
self.fib_array[i] = self.fib_array[
i - 1] + self.fib_array[i - 2]
else:
self.fib_array = [None] * (N + 1)
self.fib_array.append(self.fib_array[i - 1] + self.fib_array[i - 2])
elif N == 0:
self.fib_array.append(0)
def get(self, sequence_no=None):
if sequence_no:
if sequence_no != None:
if sequence_no < len(self.fib_array):
return print(self.fib_array[:sequence_no])
return print(self.fib_array[:sequence_no + 1])
else:
print("Out of bound.")
else:
print("Please specify the a value")
print("Please specify a value")
if __name__ == '__main__':