Question d’entretien chez Cisco
Write fibonacci with memoization (dynamic programming).
Réponse à la question d'entretien
Utilisateur anonyme
19 nov. 2019
from functools import lru_cache @lru_cache(maxsize=None) def fibonacci(n): if n == 0 or n == 1: return n else: return fibonacci(n - 1) + fibonacci(n - 2) #DRIVER CODE# nterms = 100 for i in range(nterms): print(fibonacci(i))