2017年9月27日
96. 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, there are a total of 5 unique BST' 阅读全文
posted @ 2017-09-27 17:28 Tsunami_lj 阅读(131) 评论(0) 推荐(0) 编辑
78. Subsets
摘要： Given a set of distinct integers, nums, return all possible subsets. Note: The solution set must not contain duplicate subsets. For example,If nums =  阅读全文
posted @ 2017-09-27 16:25 Tsunami_lj 阅读(127) 评论(0) 推荐(0) 编辑
22. Generate Parentheses
摘要： Given n pairs of parentheses, write a function to generate all combinations of well-formed parentheses. For example, given n = 3, a solution set is: 阅读全文
posted @ 2017-09-27 10:54 Tsunami_lj 阅读(139) 评论(0) 推荐(0) 编辑
17. Letter Combinations of a Phone Number
摘要： Given a digit string, return all possible letter combinations that the number could represent. A mapping of digit to letters (just like on the telepho 阅读全文
posted @ 2017-09-27 10:24 Tsunami_lj 阅读(117) 评论(0) 推荐(0) 编辑