文章目录
更多LeetCode题解
The Tribonacci sequence Tn is defined as follows:
T 0 = 0 T_0 = 0 T0=0, T 1 = 1 T_1 = 1 T1=1, T 2 = 1 T_2 = 1 T2=1, and T n + 3 = T n + T n + 1 + T n + 2 T_{n+3} = T_n + T_{n+1} + T_{n+2} Tn+3=Tn+Tn+1+Tn+2 for n >= 0.
Given n
, return the value of
T
n
T_n
Tn.
Example 1:
Input: n = 4
Output: 4
Explanation:
T 3 = 0 + 1 + 1 = 2 T_3 = 0 + 1 + 1 = 2 T3=0+1+1=2
T 4 = 1 + 1 + 2 = 4 T_4 = 1 + 1 + 2 = 4 T4=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
.
Solution
简单迭代可解。
class Solution {
public:
int tribonacci(int n) {
vector<int> tribo;
tribo.push_back(0);
tribo.push_back(1);
tribo.push_back(1);
if(n>=0&&n<3){
return tribo[n];
}
else{
for(int i=3;i<=n;i++){
tribo.push_back(tribo[i-1]+tribo[i-2]+tribo[i-3]);
}
}
return tribo[n];
}
};