题解 | #斐波那契数列#
斐波那契数列
http://www.nowcoder.com/practice/c6c7742f5ba7442aada113136ddea0c3
-- coding:utf-8 --
class Solution: def Fibonacci(self, n): # write code here n1 = 1 n2 = 1 if n ==1 or n == 2: return 1 cur = 0 for idx in range(3, n+1): cur = n1 + n2 n1 = n2 n2 = cur return cur
