[Leetcode 96, Medium] Unique Binary Search Trees

Problem:

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

Analysis:

Solutions:

C++:

    int numTrees(int n) {
        if(n == 0)
            return n;

        vector<int> nums;
        nums.push_back(1);
        for(int level = 1; level < n; ++level) {
            int sum = 0;
            for(int i = 0; i <= level; ++i) {
                if(i == 0 || i == level)
                    sum += nums[level - 1];
                else
                    sum += nums[i - 1] * nums[level - 1 - i];
            }
            nums.push_back(sum);
        }
        
        return nums[nums.size() - 1];
    }

Java :

Python: