#Leetcode# 96. Unique Binary Search Trees

佚名 6年前 (2019-05-06) 随笔 1685人围观抢沙发百度已收录

https://leetcode.com/problems/unique-binary-search-trees/

SRE实战互联网时代守护先锋，助力企业售后服务体系运筹帷幄！一键直达领取阿里云限量特价优惠。

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

代码：

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

　　卡特兰数人生中第二次遇见好吧我还是认不出

儿女情长好像也不影响我们行走江湖 FH