摘要: Given n, how many structurally unique BST's (binary search trees) that store values 1 ... n? Example: Input: 3 Output: 5 Explanation: Given n = 3, the 阅读全文
posted @ 2020-01-07 12:41 xuan_abc 阅读(106) 评论(0) 推荐(0)