[프로그래머스 3] 2xN 타일링 (C/C++)

#include <string>
#include <vector>
using namespace std;
 
long long dp[60010];
 
int solve(int n)
{
    if(n == 0)
    {
        return 1;
    }
        
    if(dp[n] != 0)
    {
        return dp[n];
    }
    
    if(n-2 >= 0)
    {
        dp[n] += (solve(n-2) % 1000000007);
    }
    
    if(n-1 >= 0)
    {
        dp[n] += (solve(n-1) % 1000000007);
    }
    
    return dp[n] % 1000000007;
}
 
int solution(int n) 
{
    int ans = solve(n);
    
    return ans;
}