码迷,mamicode.com
首页 >  
搜索关键字:kth largest    ( 1961个结果
projecteuler---->problem=4----Largest palindrome product
title: Largest palindrome product Problem 4 A palindromic number reads the same both ways. The largest palindrome made from the product of two 2-digit numbers is 9009 = 91 99. Find the l...
分类:其他好文   时间:2014-06-07 01:24:27    阅读次数:398
LeetCode: Subsets [078]
class Solution { public: void dfs(vector<vector >&result, vectorcombination, vector&candidates, int kth, int k, int index2add){ // 当前正在确定组合中的第kth个数,将把候选集candidates中index2add索引位的值作为第kth个数加到组合中 combination.push_back(ca...
分类:其他好文   时间:2014-06-07 01:21:47    阅读次数:220
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-04 19:30:13    阅读次数:230
针对上课内容的想法
int Largest(int list[], int length){ int i,max; for(i = 0; i max) { max=list[i]; } } return max;}首先进行...
分类:其他好文   时间:2014-06-03 09:53:50    阅读次数:267
笔试算法题(55):快速排序实现之非递归实现,最小k值选择(non-recursive version, Minimal Kth Selection of Quick Sort)
议题:快速排序实现之五(非递归实现,短序列优先处理,减少递归栈大小)分析:算法原理:此算法实现适用于系统栈空间不足够快速排序递归调用的需求,从而使用非递归实现快速排序算法;使用显示下推栈存储快速排序中的每一次划分结果 (将left和right都压入堆栈),并且首先处理划分序列较短的子序列(也就是在得...
分类:其他好文   时间:2014-06-03 08:23:29    阅读次数:367
LeetCode: Maximal Rectangle [085]
【题目】 Given a 2D binary matrix filled with 0's and 1's, find the largest rectangle containing all ones and return its area. 【题意】 给定一个由0和1填充的二维矩阵,找一个全是1的最大矩形 【思路】 扫描二维矩阵,凡是扫到值为1的块时候,以当前块为矩形的左上角区块拓展,找最大矩阵。 先找出以每个“1”区块为左上角区块的最大矩形,然后求出最大全局的最大矩...
分类:其他好文   时间:2014-06-02 23:08:07    阅读次数:289
LeetCode: Largest Rectangle in Histogram [084]
【题目】 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 where width of each bar is 1, given height = [2,1,5,6,2,3]. The...
分类:其他好文   时间:2014-06-01 10:46:29    阅读次数:242
projecteuler---->problem=11----Largest product in a grid
In the 2020 grid below, four numbers along a diagonal line have been marked in red. 08 02 22 97 38 15 00 40 00 75 04 05 07 78 52 12 50 77 91 08 49 49 99 40 17 81 18 57 60 87 17 40 98 43 69 48 04 56 ...
分类:其他好文   时间:2014-06-01 10:04:38    阅读次数:419
uva 11324 The Largest Clique(强连通分量缩点+DAG动态规划)
http://uva.onlinejudge.org/index.php?option=com_onlinejudge&Itemid=8&category=25&page=show_problem&problem=2299题意:输入n和m,有n个点和m条有向边,求出一个节点集合包括的节点个数最多,而...
分类:其他好文   时间:2014-05-31 03:26:25    阅读次数:239
Coursera Algorithm II PA2 Q2
题意:what is the largest value ofksuch that there is ak-clustering with spacing at least 3? That is, how many clusters are needed to ensure that no pair...
分类:其他好文   时间:2014-05-29 20:39:26    阅读次数:305
© 2014 mamicode.com 版权所有  联系我们:gaon5@hotmail.com
迷上了代码!