2016年4月29日
LeetCode 152
摘要： Maximum Product Subarray Find the contiguous subarray within an array (containing at least one number)which has the largest product. For example, give 阅读全文
posted @ 2016-04-29 16:36 Juntaran 阅读(157) 评论(0) 推荐(0)
LeetCode 238
摘要： Product of Array Except Self Given an array of n integers where n > 1, nums, return an array output such that output[i] is equal to the product of all 阅读全文
posted @ 2016-04-29 03:39 Juntaran 阅读(238) 评论(0) 推荐(0)
LeetCode 42
摘要： Trapping Rain Water Given n non-negative integers representing an elevation map where the width of each bar is 1, compute how much water it is able to 阅读全文
posted @ 2016-04-29 03:38 Juntaran 阅读(165) 评论(0) 推荐(0)