Advertisement
Not a member of Pastebin yet?
Sign Up,
it unlocks many cool features!
- class Solution {
- public:
- int tribonacci(int n){
- if(n==0)
- return 0;
- if(n==1)
- return 1;
- if(n==2)
- return 1;
- int dp[38];
- dp[0] = 0,dp[1] = 1,dp[2] = 1;
- for(int i=3;i<38;i++){
- dp[i] = dp[i-1]+dp[i-2]+dp[i-3];
- }
- return dp[n];
- }
- };
Advertisement
Add Comment
Please, Sign In to add comment
Advertisement