[Python][프로그래머스][Level4] 올바른 괄호의 갯수

def solution(n):
    dp = [1]*(n+1)
    for i in range(2,n+1):
        dp[i] = sum([dp[j]*dp[i-1-j] for j in range(i)])
    return dp[n]