LeetCode 刷题记录 96. Unique Binary Search Trees

题目：
Given n, how many structurally unique BST’s (binary search trees) that store values 1 … n?

Example:

Input: 3
Output: 5
Explanation:
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
解法：
动态规划

（来自LeetCode题解，151道题完整版 ）
c++：

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

java：

class Solution {
    public int numTrees(int n) {
        int[] f = new int[n+1]; 
        f[0] = 1;
        f[1] = 1;
        
        for(int i = 2; i <= n; i++){
            for(int k =1; k <= i;k++){
                f[i] += f[k-1] * f[i-k];
            }
        }
        return f[n];
    }
}

python：

class Solution(object):
    def numTrees(self, n):
        """
        :type n: int
        :rtype: int
        """
        f = [0] * (n+1)
        f[0] = 1
        f[1] = 1
        
        for i in xrange(2,n+1):
            for k in xrange(1,i+1):
                f[i] += f[k-1] * f[i-k]
            
        
        return f[n]