Leetcode-Question-96: Unique Binary Search Trees

原文链接:
https://leetcode.com/problems/unique-binary-search-trees/

题目描述:
96. Unique Binary Search Trees
Difficulty: Medium

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.

解析:动态规划法

 

发表评论

电子邮件地址不会被公开。 必填项已用*标注