def stairs_jumps(n):
if n is None:
return
if n <= 2:
return n
dp = [0 for _ in range(n)]
dp[0], dp[1] = 1, 2
for i in range(2, n):
dp[i] = dp[i - 1] + dp[i - 2]
print('\n DP: ')
print(dp)
print('\n Result: ')
# print(dp[-1][-1])
return dp[-1]
def main():
n = 10
print('N: ')
print(n)
print(stairs_jumps(n))
print('==' * 20)
if __name__ == "__main__":
main()
声明:题目原出自<https://leetcode-cn.com/>