leetcode JAVA Unique Binary Search Trees 难度系数3 3.34

最新推荐文章于 2014-08-27 16:30:11 发布

yundomo

最新推荐文章于 2014-08-27 16:30:11 发布

阅读量1.3k

点赞数

本文链接：https://blog.csdn.net/yiding_he/article/details/18938093

版权

leetcode java 150 专栏收录该内容

86 篇文章 0 订阅

订阅专栏

Question：

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

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