码迷,mamicode.com
首页 >  
搜索关键字:kth largest    ( 1961个结果
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-06-20 08:59:38    阅读次数:235
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,...
分类:其他好文   时间:2014-06-19 12:08:20    阅读次数:270
LeetCode OJ平台上Maximum Subarray题目O(n)复杂度解决方案
原始题目如下,意为寻找数组和最大的子串,返回这个最大和即可。 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
Maximal Rectangle
题目 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
Largest Rectangle in Histogram
题目 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
【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-06-10 09:14:50    阅读次数:211
[LeetCode] Largest Rectangle in Histogram
第一种方法,暴力求解,从当前向左右两个方向扫描比自己小的,然后计算面积,时间复杂度O(n^2)code如下,但是在LeetCode上回超时。 1 class Solution { 2 public: 3 int largestRectangleArea(vector &height) { 4...
分类:其他好文   时间:2014-06-08 21:24:07    阅读次数:328
LeetCode之Maximum Subarray
Find the contiguous subarray within an array (containing at least one number) which has the largest sum....
分类:其他好文   时间:2014-06-08 15:54:08    阅读次数:258
LeetCode: Pascal's Triangle II [119]
【题目】 Given an index k, return the kth row of the Pascal's triangle. For example, given k = 3, Return [1,3,3,1]. Note: Could you optimize your algorithm to use only O(k) extra space? 【题意】 给定行索引k, k从0开始,返回该索引指向的杨辉三角的行 要求只能使用O(k)的额外空间 【思路】 ...
分类:其他好文   时间:2014-06-08 15:46:02    阅读次数:272
Get the largest sum of contiguous subarray in an int array
When I finished reading this problem,I thought I could solve it by scan every single subarray in the array,and the time complexity is cubic.Every su.....
分类:其他好文   时间:2014-06-04 15:30:52    阅读次数:255
© 2014 mamicode.com 版权所有  联系我们:gaon5@hotmail.com
迷上了代码!