class Solution { public: int tribonacci(int n) { int dp[n+4]; for(int i=0;i<n+1;i++) { dp[i]=-1; } dp[0]=0; dp[1]=1; dp[2]=1; for(int i=3;i<n+1;i++) { dp[i]=dp[i-1]+dp[i-2]+dp[i-3]; } return dp[n]; } };
Preview:
downloadDownload PNG
downloadDownload JPEG
downloadDownload SVG
Tip: You can change the style, width & colours of the snippet with the inspect tool before clicking Download!
Click to optimize width for Twitter