https://school.programmers.co.kr/learn/courses/30/lessons/12929

제출 코드

class Solution {
    public int solution(int n) {
        int[] dp = new int[15];
        dp[0] = 1;
        dp[1] = 1;
        for (int i = 2; i <= n; i++) {
            for (int j = 0; j < i; j++) {
                dp[i] += (dp[j] * dp[i - j - 1]);
            }
        }
        return dp[n];
    }
}