leetcode - 96.Unique Binary Search Trees

最新推荐文章于 2021-09-11 12:44:04 发布

xiedacon

最新推荐文章于 2021-09-11 12:44:04 发布

阅读量371

点赞数

分类专栏： leetcode题集文章标签： leetcode

本文链接：https://blog.csdn.net/qq_27350929/article/details/63262359

版权

leetcode题集专栏收录该内容

96 篇文章 0 订阅

订阅专栏

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, your program should return all 5 unique BST’s shown below.

  1         3     3      2      1
   \       /     /      / \      \
    3     2     1      1   3      2
   /     /       \                 \
  2     1         2                 3

Solution:

  public int numTrees(int n) {
    int[] G = new int[n + 1];
    G[0] = G[1] = 1;

    for (int i = 2; i <= n; ++i) {
      for (int j = 1; j <= i; ++j) {
        G[i] += G[j - 1] * G[i - j];
      }
    }

    return G[n];
  }