Package g1101_1200.s1137_n_th_tribonacci_number

Class Solution

  • All Implemented Interfaces:
    
public final class Solution

    1137 - N-th Tribonacci Number.

    Easy

    The Tribonacci sequence T<sub>n</sub> is defined as follows:

    T<sub>0</sub> = 0, T<sub>1</sub> = 1, T<sub>2</sub> = 1, and T<sub>n+3</sub> = T<sub>n</sub> + T<sub>n+1</sub> + T<sub>n+2</sub> for n >= 0.

    Given n, return the value of T<sub>n</sub>.

    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:

    • 0 &lt;= n &lt;= 37

    • The answer is guaranteed to fit within a 32-bit integer, ie. answer &lt;= 2^31 - 1.

    • Nested Class Summary

      Nested Classes 
      Modifier and Type Class Description

    • Field Summary

      Fields 
      Modifier and Type Field Description

    • Constructor Summary

      Constructors 
      Constructor Description
      Solution()

    • Enum Constant Summary

      Enum Constants 
      Enum Constant Description

    • Method Summary

      Modifier and Type Method Description
      final Integer tribonacci(Integer n)

      • Methods inherited from class java.lang.Object

        clone, equals, finalize, getClass, hashCode, notify, notifyAll, toString, wait, wait, wait