和509. 斐波那契数一样~
简单题玩耍一波 重拳出击哈哈哈
java:
class Solution {
public int tribonacci(int n) {
if(n == 0){
return 0;
}
if(n <= 2){
return 1;
}
int p = 0, q = 0 ,r = 1, s = 1;
for(int i = 3; i <= n; i++){
p = q;
q = r;
r = s;
s = p + q + r;
}
return s;
}
}
python3:
class Solution:
def tribonacci(self, n: int) -> int:
if n == 0:
return 0
if n <= 2:
return 1
p, q, r, s = 0, 0, 1, 1
for i in range(3, n + 1):
p = q
q = r
r = s
s = p + q + r
return s