(Easy) N-th Tribonacci Number LeetCode

class Solution {
    public int tribonacci(int n) {
        
      
        if(n==2||n==1){
            
            return 1;
        }
        else if (n==0){
            
            return 0;
        }
        
        else {
            return tribonacci(n-1)+tribonacci(n-2)+tribonacci(n-3);
        }
        
    }
}

 

 

Without using Reccursion

class Solution {
    public int tribonacci(int n) {
       int [] arr = new int[n+4];
       arr[0] = 0;
       arr[1] = 1;
       arr[2] = 1;
        
       for(int i = 3; i < arr.length; i++){
           arr[i] = arr[i-1] + arr[i-2] + arr[i-3];
       }
        
        return arr[n];
        
      }
      
}