Skip to content

Latest commit

 

History

History
75 lines (38 loc) · 1.12 KB

File metadata and controls

75 lines (38 loc) · 1.12 KB

中文文档

Description

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.

 

Example 1:

Input: n = 4

Output: 4

Explanation:

T_3 = 0 + 1 + 1 = 2

T_4 = 1 + 1 + 2 = 4

Example 2:

Input: n = 25

Output: 1389537

 

Constraints:

    <li><code>0 &lt;= n &lt;= 37</code></li>
    
    <li>The answer is guaranteed to fit within a 32-bit integer, ie. <code>answer &lt;= 2^31 - 1</code>.</li>
    

Solutions

Python3

Java

...