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

二、思路

动态规划，递归式为：

v(n) = v(0) * v(n - 1) + v(1) * v(n - 2) +... + v(n - 1) * v(0)

三、代码

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