2016年8月7日
Unique Binary Search Trees II
摘要： Given an integer n, generate all structurally unique BST's (binary search trees) that store values 1...n. For example,Given n = 3, your program should 阅读全文
posted @ 2016-08-07 06:01 amazingzoe 阅读(150) 评论(0) 推荐(0)
Longest Increasing Subsequence
摘要： Given an unsorted array of integers, find the length of longest increasing subsequence. For example,Given [10, 9, 2, 5, 3, 7, 101, 18],The longest inc 阅读全文
posted @ 2016-08-07 05:07 amazingzoe 阅读(162) 评论(0) 推荐(0)
Combination Sum IV
摘要： Given an integer array with all positive numbers and no duplicates, find the number of possible combinations that add up to a positive integer target. 阅读全文
posted @ 2016-08-07 03:25 amazingzoe 阅读(139) 评论(0) 推荐(0)
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 @ 2016-08-07 02:17 amazingzoe 阅读(152) 评论(0) 推荐(0)
Decode Ways
摘要： A message containing letters from A-Z is being encoded to numbers using the following mapping: Given an encoded message containing digits, determine t 阅读全文
posted @ 2016-08-07 01:50 amazingzoe 阅读(146) 评论(0) 推荐(0)