2015年1月8日
[LeetCode] Min Stack
摘要： Design a stack that supports push, pop, top, and retrieving the minimum element in constant time.push(x) -- Push element x onto stack.pop() -- Removes... 阅读全文
posted @ 2015-01-08 11:58 Eason Liu 阅读(420) 评论(0) 推荐(0)
[LeetCode] Find Minimum in Rotated Sorted Array
摘要： Suppose a sorted array is rotated at some pivot unknown to you beforehand.(i.e.,0 1 2 4 5 6 7might become4 5 6 7 0 1 2).Find the minimum element.You m... 阅读全文
posted @ 2015-01-08 11:45 Eason Liu 阅读(175) 评论(0) 推荐(0)
[LeetCode] Maximum Product Subarray
摘要： 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 @ 2015-01-08 11:26 Eason Liu 阅读(128) 评论(0) 推荐(0)