96. Unique Binary Search Trees
source: https://leetcode.com/problems/unique-binary-search-trees/
Question
Given an integer n, return the number of structurally unique BST's (binary search trees) which has exactly n nodes of unique values from 1 to n.
初想法
pub fn num_trees(n: i32) -> i32 {
}