Leetcode # 96 Unique Binary Search Trees

Given n, how many structurally unique BST's (binary search trees) that store values 1...n?

For example,
Given n = 3, there are a total of 5 unique BST's.

   1         3     3      2      1
    \       /     /      / \      \
     3     2     1      1   3      2
    /     /       \                 \
   2     1         2                 3

Difficulty:Medium

数学的方法。

int numTrees(int n) {
        vector<int> nums;
        nums.push_back(1);
        nums.push_back(1);
        
        for(int i = 2;i<=n;i++)
        {
            int ans = 0;
            for(int j = 0;j<i;j++)
            {
                ans+=nums[j]*nums[i-1-j];
            }
            nums.push_back(ans);
        }
        return nums[n];
        
    }