Decorator1 [자료구조] 재귀함수 파이썬 (recursive, iterative, decorator, reduce) Fibonacci 피보나치 (recursively & iteratively) 삼항 연산자(Ternary operators)로 풀이 (출처는 아래에) # basic recusrive solution def fibo(n): return fibo(n-1) + fibo(n-2) if n >= 2 else n # basic iterative solution def fibo(n): if n < 2: return n a, b = 0, 1 for i in range(n-1): a, b = b, a + b return b # iterative w/ DP def fibo(n): if n < 2: return n cache = [0 for _ in range(n+1)] cache[1] = 1 for i in range(2,.. 2021. 4. 20. 이전 1 다음