剑指 Offer 10- II. 青蛙跳台阶问题

剑指 Offer 10- II. 青蛙跳台阶问题

class Solution:
    def numWays(self, n: int) -> int:
        #这里考察的是建模
        if n < 2:
            return 1
        fn, fn1, fn2 = 1, 1, 1 
        for i in range(2, n+1):
            fn = fn1 + fn2
            fn2 = fn1
            fn1 = fn
        return fn % (10**9+7)