码迷,mamicode.com
首页 >  
搜索关键字:least    ( 1796个结果
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 array[2,3,-2,4],the...
分类:其他好文   时间:2014-10-09 01:08:37    阅读次数:231
[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,?5,4], the contiguous subarray [4,?1,2,1] ha...
分类:其他好文   时间:2014-10-08 18:06:55    阅读次数:163
LeetCode:Maximum Product Subarray
题目:Maximum Product SubarrayFind the contiguous subarray within an array (containing at least one number) which has the largest product. For example, g...
分类:其他好文   时间:2014-10-05 21:45:29    阅读次数:198
【Leetcode】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...
分类:其他好文   时间:2014-10-02 14:48:03    阅读次数:261
[Leetcode][JAVA] 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...
分类:编程语言   时间:2014-10-01 02:29:00    阅读次数:222
[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 array[2,3,-2,4],the...
分类:其他好文   时间:2014-09-29 03:53:16    阅读次数:255
使用C++实现一个LRU cache
什么是LRU Cache LRU是Least Recently Used的缩写,意思是最近最少使用,它是一种Cache替换算法。什么是Cache?狭义的Cache指的是位于CPU和主存间的快速RAM,通常它不像系统主存那样使用DRAM技术,而使用昂贵但较快速的SRAM技术。广义上的Cache指的是位于速度相差较大的两种硬件之间,用于协调两者数据传输速度差异的结构。除了CPU与主存之间有Cache...
分类:编程语言   时间:2014-09-28 13:58:32    阅读次数:294
[leetcode] Maximum Product Subarray @ python
[leetcode] Latest added:2014-09-23Find the contiguous subarray within an array (containing at least one number) which has the largest product.For exam...
分类:编程语言   时间:2014-09-28 01:51:00    阅读次数:499
System and method for cache management
Aspects of the invention relate to improvements to the Least Recently Used (LRU) cache replacement method. Weighted LRU (WLRU) and Compact Weighted LR...
分类:其他好文   时间:2014-09-26 19:37:08    阅读次数:147
[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 array [2,3,-2,4], the contiguous subarray [2,3] has the larges...
分类:其他好文   时间:2014-09-26 15:03:38    阅读次数:359
© 2014 mamicode.com 版权所有  联系我们:gaon5@hotmail.com
迷上了代码!