leetcode 96. Unique Binary Search Trees

动态规划解决

class Solution {
public:
    int numTrees(int n) {
        vector<int> dp(n+1);
        dp[0] = 1;
        for(int i = 1;i<=n;i++){
            dp[i] = 0;
            for(int j = 0;j < i;j++)
                dp[i] += dp[j]*dp[i-1-j];
        }
        return dp[n];
    }
};