码迷,mamicode.com
首页 >  
搜索关键字:largest rectangular    ( 1806个结果
85. Maximal Rectangle
Given a 2D binary matrix filled with 0's and 1's, find the largest rectangle containing only 1's and return its area. For example, given the following ...
分类:其他好文   时间:2016-09-18 22:01:34    阅读次数:111
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 ...
分类:其他好文   时间:2016-09-15 15:05:05    阅读次数:135
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, ...
分类:其他好文   时间:2016-09-15 13:40:32    阅读次数:120
九度oj 题目1460:Oil Deposit
The GeoSurvComp geologic survey company is responsible for detecting underground oil deposits. GeoSurvComp works with one large rectangular region of ...
分类:其他好文   时间:2016-09-15 12:27:32    阅读次数:177
lua table integer index 特性
table.maxn (table) Returns the largest positive numerical index of the given table, or zero if the table has no positive numerical indices. (To do its ...
分类:其他好文   时间:2016-09-15 00:52:56    阅读次数:213
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, ...
分类:其他好文   时间:2016-09-13 16:31:25    阅读次数:144
POJ 1753 (枚举+DFS)
Flip Game Time Limit: 1000MS Memory Limit: 65536K Total Submissions: 40632 Accepted: 17647 Description Flip game is played on a rectangular 4x4 field ...
分类:其他好文   时间:2016-09-11 09:01:30    阅读次数:147
LintCode刷题笔记-- Maximum Product Subarray
标签: 动态规划 描述: Find the contiguous subarray within an array (containing at least one number) which has the largest product. Find the contiguous subarray ...
分类:其他好文   时间:2016-09-10 01:29:31    阅读次数:148
LintCode刷题笔记-- Maximal Square
标签:动态规划 题目描述: Given a 2D binary matrix filled with 0's and 1's, find the largest square containing all 1's and return its area. Example For example, g ...
分类:其他好文   时间:2016-09-10 01:21:33    阅读次数:251
LeetCode53 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,- ...
分类:其他好文   时间:2016-09-10 00:04:46    阅读次数:159
1806条   上一页 1 ... 67 68 69 70 71 ... 181 下一页
© 2014 mamicode.com 版权所有  联系我们:gaon5@hotmail.com
迷上了代码!