题目 解题思路 用动态规划,根据题目易得状态转移方程为dp[i] = dp[i-1] + dp[i-2] 代码 class Solution: def fib(self, n: int) -> int: if n<2: return n else: dp = [0]*(n+1) dp[0] = 0 dp[1] = 1 for i in range(2,n+1): dp[i] = dp[i-1] + dp[i-2] return dp[n]