Search

[1137] N-th Tribonacci Number

태그
Dynamic Programming
Tier
Easy
날짜
2025/04/10

Question

The Tribonacci sequence Tn is defined as follows:
T0 = 0, T1 = 1, T2 = 1, and Tn+3 = Tn + Tn+1 + Tn+2 for n >= 0.
Given n, return the value of Tn.

My Answer

class Solution: def tribonacci(self, n: int) -> int: d = [0]*40 d[1] = 1 d[2] = 1 d[3] = 2 d[4] = 4 if n <= 4: return d[n] for i in range(5,n+1): d[i] = d[i-1]+d[i-2]+d[i-3] return d[n]
Python
복사