码迷,mamicode.com
首页 >  
搜索关键字:largest    ( 1413个结果
[leetcode] 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 hist...
分类:其他好文   时间:2014-07-03 11:09:35    阅读次数:185
Structure and Interpretation of Computer Programs-Exercise 1.3
【问题】 Define a procedure that takes three numbers as arguments and returns the sum of the squares of the two larger numbers. 定义一个过程,它以三个数为参数,返回其中较大的两个数的平方和。 【普通版】 (define (sum-square-largest x y ...
分类:其他好文   时间:2014-06-30 00:19:52    阅读次数:270
Leetcode Largest Rectangle in Histogram
Givennnon-negative integers representing the histogram's bar height where the width of each bar is 1, find the area of largest rectangle in the histog...
分类:其他好文   时间:2014-06-27 23:01:16    阅读次数:259
[leetcode] Maximum Subarray
Find the contiguous subarray within an array (containing at least one number) which has the largest sum.
分类:其他好文   时间:2014-06-27 11:43:25    阅读次数:173
UVA - 11324 The Largest Clique 强连通缩点+记忆化dp
题目要求一个最大的弱联通图。 首先对于原图进行强连通缩点,得到新图,这个新图呈链状,类似树结构。 对新图进行记忆化dp,求一条权值最长的链,每个点的权值就是当前强连通分量点的个数。 /* Tarjan算法求有向图的强连通分量set记录了强连通分量 Col记录了强连通分量的个数。 */ #include #include #include #include #include usin...
分类:其他好文   时间:2014-06-27 10:12:12    阅读次数:275
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-26 15:10:47    阅读次数:168
Leetcode 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.时间复杂度O(n^3),最大全1子矩阵,利用直方图求解,可以参考对...
分类:其他好文   时间:2014-06-26 15:08:46    阅读次数:164
limestonelimestone crushing plant
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
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
© 2014 mamicode.com 版权所有  联系我们:gaon5@hotmail.com
迷上了代码!