题目描述:
题解:
class Solution(object): def tribonacci(self, n): tres = [] tres.append(0) tres.append(1) tres.append(1) if n<=2: return tres[n] for i in range(3,n+1): tres.append(tres[i-1]+tres[i-2]+tres[i-3]) return tres[n]
题目描述:
题解:
class Solution(object): def tribonacci(self, n): tres = [] tres.append(0) tres.append(1) tres.append(1) if n<=2: return tres[n] for i in range(3,n+1): tres.append(tres[i-1]+tres[i-2]+tres[i-3]) return tres[n]