摘要: Given an integer n, generate all structurally unique BST's (binary search trees) that store values 1 ... n. Example: Input: 3 Output: [ [1,null,3,2], 阅读全文
posted @ 2020-01-08 11:36 xuan_abc 阅读(108) 评论(0) 推荐(0)