代码实现:
public int tribonacci(int n) {
if(n<=1) return n;
if(n==2) return 1;
int []dp = new int[n+1];
dp[0]=0;
dp[1]=1;
dp[2]=1;
for (int i=3;i<=n;i++)
dp[i]=dp[i-1]+dp[i-2]+dp[i-3];
return dp[n];
}
标签：契数,return,int,个泰波,1137,dp
来源： https://www.cnblogs.com/ywy1/p/15549669.html