动态规划——跳台阶扩展

题目

题解

n = int(input())
def func(n):
    if n <= 2:
        return n 
    dp = [1]*(n+1)
    for i in range(2, n+1):
        j = i
        dp[i] = 0
        for i2 in range(0, j):
            dp[i] += dp[i2]
    return dp[n]
print(func(n))