码迷,mamicode.com
首页 >  
搜索关键字:least    ( 1796个结果
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,?1,2,1,?5,4], the contiguous subarray [4,?1,2,1] ha...
分类:其他好文   时间:2015-06-23 11:55:55    阅读次数:176
Codeforces #2B The least round way(DP)
Description 有一个n*n的正整数矩阵,要你求一条从第一行第一列的格子到第n行第n列的路,使得你走过的格子里面的数乘起来的值末尾的零的个数最小。输出最小个数。 Input 第一行包含1个数n。 接下来n行每行n个数字。 Output 一个数字表示末尾零最小个数。 Sample Input 3 1 2 3 4 5 6 7 ...
分类:其他好文   时间:2015-06-23 00:54:37    阅读次数:147
内部排序(五)基数排序
基数排序是一种借助多关键字排序的思想对单逻辑关键字进行排序的方法。实现的过程不需要之前的所有排序所需要的记录关键字比较,移动等操作。 多关键字排序: 多关键字排序通常有两种方法: 1、MSD(Most Significant Digit)法,最高为优先法 2、LSD(Least Significant Digit)法,最低位优先法过程借助分配,收集两种操作。数组基数排序:过程演示:第一步...
分类:编程语言   时间:2015-06-21 09:30:28    阅读次数:197
[LeetCode] LRU Cache 缓存器
Design and implement a data structure for Least Recently Used (LRU) cache. It should support the following operations: get and set. get(key) - Get the...
分类:系统相关   时间:2015-06-19 07:50:56    阅读次数:247
RMQ与LCA
一、什么是LCA?LCA:Least Common Ancestors(最近公共祖先),对于一棵有根树T的任意两个节点u,v,求出LCA(T, u, v),即离跟最远的节点x,使得x同时是u和v的祖先。二、算法分类 求LCA的算法很多,按照是否在线可以分为在线算法和离线算法。在线算法:用比较长的时....
分类:其他好文   时间:2015-06-17 23:01:10    阅读次数:116
天题系列: LRU Cache
Design and implement a data structure for Least Recently Used (LRU) cache. It should support the following operations:getandset.get(key)- Get the valu...
分类:系统相关   时间:2015-06-17 07:06:08    阅读次数:158
LeetCode 146 LRU Cache
Design and implement a data structure for Least Recently Used (LRU) cache. It should support the following operations:getandset.get(key)- Get the valu...
分类:系统相关   时间:2015-06-14 16:23:48    阅读次数:176
Maximum Product Subarray -- leetcode
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], the contiguous subarray [2,3] has the largest ...
分类:其他好文   时间:2015-06-14 13:50:36    阅读次数:91
leetcode之Contains Duplicate
Given an array of integers, find if the array contains any duplicates. Your function should return true if any value appears at least twice in the arr...
分类:其他好文   时间:2015-06-12 13:07:15    阅读次数:99
LeetCode之“动态规划”:Maximum Product Subarray
题目链接 题目要求: Find the contiguous subarray within an array (containing at least one number) which has the largest product. For example, given the ar...
分类:其他好文   时间:2015-06-12 11:29:03    阅读次数:100
© 2014 mamicode.com 版权所有  联系我们:gaon5@hotmail.com
迷上了代码!