Indeed
Parte de Recruit Holdings, Co., Ltd.
Empresa activa
Pregunta de entrevista de Indeed
Implement the Fibonacci sequence with O(n)
Respuestas de entrevistas
Anónimo
10 jun 2016
Python: def iterative_fib(n): last_1 = 0; last_2 = 1; for i in range(1, n): fib = last_1 + last_2 last_1 = last_2 last_2 = fib return fib The recursive solution IS NOT O(n)!
2