class Solution {
public int tribonacci(int n) {
if(n == 0)
return 0;
if(n == 1 || n == 2)
return 1;
int a = 0, b = 1, c = 1;
for(int i = 3; i <= n; ++i) {
int sum = a + b + c;
a = b;
b = c;
c = sum;
}
return c;
}
}
LeetCode 1137第N个斐波那契数
最新推荐文章于 2021-03-04 14:58:20 发布