LeetCode - 509.Fibonacci Num & 1137. N-th Tribonacci Number

Fibonacci 와 Tribonacci 이다. 

푸는 방법은 똑같지롱.

Fibonacci 

int dp[100] = {0,};
int fib(int n){
    if(n == 0) return 0;
    else if(n == 1) return 1;
    
    if(dp[n] > 0) return dp[n];
    else {
        dp[n] = fib(n-1) + fib(n-2);
    }
    return dp[n];
}

Tribonacci

int dp[100] = {0,};
int tribonacci(int n)
{
	if(n == 0) return 0;
    else if(n == 1|| n == 2) return 1;
    
    if(dp[n] > 0) return dp[n];
    else {
    	dp[n] = tribonacci(n-3) + tribonacci(n-2) + tribonacci(n-1);    	
    }
    return dp[n];
}