2014年10月12日
3 3Sum closest_Leetcode
摘要： Given an array S of n integers, find three integers in S such that the sum is closest to a given number, target. Return the sum of the three integers.... 阅读全文
posted @ 2014-10-12 16:28 Avril 阅读(245) 评论(0) 推荐(0)
2 Unique Binary Search Trees II_Leetcode
摘要： Given n, generate all structurally unique BST's (binary search trees) that store values 1...n.For example,Given n = 3, your program should return all ... 阅读全文
posted @ 2014-10-12 15:52 Avril 阅读(196) 评论(0) 推荐(0)
1 Maximum Product Subarray_Leetcode
摘要： Find the contiguous subarray within an array (containing at least one number) which has the largest product.For example, given the array[2,3,-2,4],the... 阅读全文
posted @ 2014-10-12 14:54 Avril 阅读(468) 评论(0) 推荐(0)