【入门必刷-leetcode题库】剑指offer（第2版）10- II. 青蛙跳台阶问题

class Solution:
    def numWays(self, n: int) -> int:
        #本题与动态规划-爬楼梯共有几种爬法相同
        if n<=1:
            return 1
        #F=[0]*(n+2)
        #F[1]=1
        a,b,c=0,0,1
        #for i in range(2,n+2):
        #    F[i]=F[i-1]+F[i-2]
        #return F[n+1]
        for i in range(n):
            a,b=b,c
            c=a+b
        return c % 1000000007