码迷,mamicode.com
首页 >  
搜索关键字:subarray    ( 846个结果
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],t...
分类:其他好文   时间:2014-11-27 01:29:03    阅读次数:187
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...
分类:其他好文   时间:2014-11-21 23:06:22    阅读次数:242
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 contiguous subarray [2,3] has the largest ...
分类:其他好文   时间:2014-11-21 18:43:17    阅读次数:196
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 contiguous subarray [2,3] has the largest ...
分类:其他好文   时间:2014-11-21 18:41:59    阅读次数:174
LEETCODE —— Maximum Subarray [一维DP]
Maximum SubarrayFind the contiguous subarray within an array (containing at least one number) which has the largest sum.For example, given the array[?...
分类:其他好文   时间:2014-11-21 15:38:34    阅读次数:194
Maximum Subarray
Dynamic ProgrammingFind the contiguous subarray within an array (containing at least one number) which has the largest sum.For example, given the arra...
分类:其他好文   时间:2014-11-21 09:06:09    阅读次数:189
Maximum Product Subarray
Maximum Product SubarrayFind the contiguous subarray within an array (containing at least one number) which has the largest product.For example, given...
分类:其他好文   时间:2014-11-19 21:46:14    阅读次数:152
[leetcode]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,...
分类:其他好文   时间:2014-11-19 20:40:18    阅读次数:125
LeetCode - 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,...
分类:其他好文   时间:2014-11-19 17:48:30    阅读次数:115
Maximum Product Subarray
Dynamic ProgrammingFind the contiguous subarray within an array (containing at least one number) which has the largest product.For example, given the ...
分类:其他好文   时间:2014-11-19 10:32:17    阅读次数:175
846条   上一页 1 ... 74 75 76 77 78 ... 85 下一页
© 2014 mamicode.com 版权所有  联系我们:gaon5@hotmail.com
迷上了代码!