题解 | #跳台阶扩展问题#python动态规划
跳台阶扩展问题
https://www.nowcoder.com/practice/22243d016f6b47f2a6928b4313c85387
#
# 代码中的类名、方法名、参数名已经指定，请勿修改，直接返回方法规定的值即可
#
#
# @param number int整型
# @return int整型
#
class Solution:
def jumpFloorII(self , number: int) -> int:
# write code here
dp=[0]*(number+1)
dp[1]=1
for i in range(2,number+1):
dp[i]=sum(dp[:i])+1
return dp[number]
