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

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

链接：https://leetcode-cn.com/problems/qing-wa-tiao-tai-jie-wen-ti-lcof/

斐波拉契数列的变种，n级台阶的跳法为(n-1)和(n-2)级跳法的和

class Solution:
    def numWays(self, n: int) -> int:
        if n == 0:
            return 1
        if n <= 2:
            return n
        a, b = 1, 1
        for _ in range(n-1):
            a, b = b, a + b
        return b%1000000007