N-th Tribonacci Number

Source: N-th Tribonacci Number - LeetCode

类似这道Fibonacci Number - LeetCode

状态转移方程

题解

class Solution:
    def tribonacci(self, n: int) -> int:
        if n<2:return n
        if n==2:return 1
        dp=[0 for i in range(n+1)]
        dp[1]=1;dp[2]=1
        for i in range(3,n+1):
            dp[i]=dp[i-1]+dp[i-2]+dp[i-3]
        return dp[n]