Tribonacci序列Tn定义: T0=0, T1=1, T2=1, n>=0时，Tn 3 = Tn Tn 1 Tn 2 限制条件是: 0<=n<=37, 32位整型。 我直接用C 撸了下面的代码， #include <iostream>using namespace std;class Solution {public:int tribonacci(int n) {if (n ==

111

文章目录 一、题目二、题解 一、题目 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