Unique Binary Search Trees (leetcode)

最新推荐文章于 2018-11-13 21:20:37 发布

luckyone999

最新推荐文章于 2018-11-13 21:20:37 发布

阅读量352

点赞数

分类专栏：算法

本文链接：https://blog.csdn.net/luckyone999/article/details/39436029

版权

算法专栏收录该内容

7 篇文章 0 订阅

订阅专栏

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

class Solution {
public:
    int numTrees(int n) {
		if (0 == n) {
			return 1;
		}
		if (n == 1) {
			return 1;
		}

		int *value = new int[n + 1];
		value[0] = value[1] = 1;

		for (int i = 2; i < n + 1; ++i) {
			value[i] = 0;
			for (int j = 0; j < i; ++j) {
				value[i] += value[j] * value [i - j -1];
			}
		}
		int num_trees =  value[n];
		delete []value;
		return num_trees;
    }
};