LeetCode1137. N-th Tribonacci Number

本文主要是介绍LeetCode1137. N-th Tribonacci Number，希望对大家解决编程问题提供一定的参考价值，需要的开发者们随着小编来一起学习吧！

一、题目

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:

0 <= n <= 37
The answer is guaranteed to fit within a 32-bit integer, ie. answer <= 2^31 - 1.

二、题解

class Solution {
public:int tribonacci(int n) {vector<int> dp(n+1);if(n == 0) return 0;else if(n == 1) return 1;else if(n == 2) return 1;dp[0] = 0;dp[1] = 1;dp[2] = 1;for(int i = 3;i <= n;i++){dp[i] = dp[i-1] + dp[i-2] + dp[i-3];}return dp[n];}
};

这篇关于LeetCode1137. N-th Tribonacci Number的文章就介绍到这儿，希望我们推荐的文章对编程师们有所帮助！

---