class Solution:
def tribonacci(self, n: int) -> int:
fn = [0, 1, 1]
for i in range(2, n):
fn.append(fn[i - 2] + fn[i - 1] + fn[i])
return fn[n]
leetcode——1137.第N个泰波那契数---动态规划
最新推荐文章于 2024-09-14 18:52:56 发布