1137.费氏数列突变版（前三项和）
class Solution(object):
def tribonacci(self, n):
"""
:type n: int
:rtype: int
"""
if n == 0:
return 0
elif n == 1 or n == 2:
return 1
else:
tribonacci_sequence = [0,1,1]
for i in range (3, n+1):
tribonacci_sequence.append (tribonacci_sequence[i-1] + tribonacc
i_sequence[i-2] + tribonacci_sequence[i-3])
return tribonacci_sequence[n]
动态规划50题剩下47题
系统怎么推荐我这