L2 : 피보나치 수 Python
https://school.programmers.co.kr/learn/courses/30/lessons/12945
def solution(n):
f = [0, 1]
for i in range(2, n+1):
f = [f[1], f[0]+f[1]]
return f[1] % 1234567
https://github.com/Sungjeonghyun
https://school.programmers.co.kr/learn/courses/30/lessons/12945
def solution(n):
f = [0, 1]
for i in range(2, n+1):
f = [f[1], f[0]+f[1]]
return f[1] % 1234567