class Solution {
public:
int tribonacci(int n) {
vector<long long> temp(38, 0);
temp[0] = 0;
temp[1] = 1;
temp[2] = 1;
for(int i = 3; i <= n; i++)
{
temp[i] = temp[i - 1] + temp[i - 2] + temp[i - 3];
}
return temp[n];
}
};
leetcode | 1137题. 第 N 个泰波那契数
最新推荐文章于 2021-01-11 11:51:03 发布