题解 | #跳台阶#

class Solution:
    def jumpFloor(self , number: int) -> int:
        if number == 1:
            return 1
            
        dp = [0]*number # 其实就是斐波那楔数列，只是dp[0]，dp[1]不同
        dp[0], dp[1] = 1, 2
        for i in range(2, number):
            dp[i] = dp[i-1] + dp[i-2]

        return dp[number-1]