Find the contiguous subarray within an array (containing at least one number) which has the largest sum.
分类：
其他好文 时间：
2014-06-27 11:43:25
阅读次数：
173
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-06-26 15:10:47
阅读次数：
168
Given a 2D binary matrix filled with 0's and 1's, find the largest rectangle containing all ones and return its area.时间复杂度O(n^3)，最大全1子矩阵，利用直方图求解，可以参考对...
分类：
其他好文 时间：
2014-06-26 15:08:46
阅读次数：
164
For a period before the recent nationwide gold industry shutdown, Duration was Zimbabwe’s second largest gold producer. Up until that point, it had en...
分类：
其他好文 时间：
2014-06-25 23:20:27
阅读次数：
274
题目
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,...
分类：
其他好文 时间：
2014-06-19 12:08:20
阅读次数：
270
原始题目如下，意为寻找数组和最大的子串，返回这个最大和即可。
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...
分类：
其他好文 时间：
2014-06-14 15:08:00
阅读次数：
224
题目
Given a 2D binary matrix filled with 0's and 1's, find the largest rectangle containing all ones and return its area.
方法
使用两个矩阵，分别记录每一行连续的1的个数以及每一列连续的1的个数。
public int maximalRec...
分类：
其他好文 时间：
2014-06-11 00:24:51
阅读次数：
343
题目
Given n non-negative integers representing the histogram's bar height where the width of each bar is 1, find the area of largest rectangle in the histogram.
Above is a histogram w...
分类：
其他好文 时间：
2014-06-10 15:34:02
阅读次数：
252
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-06-10 09:14:50
阅读次数：
211
第一种方法，暴力求解，从当前向左右两个方向扫描比自己小的，然后计算面积，时间复杂度O(n^2)code如下，但是在LeetCode上回超时。
1 class Solution { 2 public: 3 int largestRectangleArea(vector &height) {
4...
分类：
其他好文 时间：
2014-06-08 21:24:07
阅读次数：
328
