最大子数组
i-Blue
抱平常心走平常路
展开
-
53. Maximum Subarray-动态规划/分治
题: Find the contiguous subarray within an array (containing at least one number) which has the largest sum. For example, given the array [-2,1,-3,4,-1,2,1,-5,4], the contiguous subarray [4,-1原创 2016-09-04 17:30:45 · 946 阅读 · 0 评论 -
LeetCode Maximum Product Subarray_DP_最大子数组
题目: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 contig原创 2017-01-07 16:07:17 · 354 阅读 · 0 评论