本文转自http://my.oschina.net/u/866190/blog/188712提到缓存，不得不提就是缓存算法(淘汰算法)，常见算法有LRU、LFU和FIFO等算法，每种算法各有各的优势和缺点及适应环境。1、LRU(Least Recently Used ，最近最少使用)算法根据数据的最...
分类：
编程语言 时间：
2015-03-17 10:23:41
阅读次数：
170
Capped Collection 固定集合 简单介绍 capped collections 是性能出色的有着固定大小的集合，以LRU（Least Recently Used最近最少使用）规则和插入顺序进行age-out（老化移出）处理，自动维护集合中对象的插入顺序...
分类：
数据库 时间：
2015-03-16 19:45:30
阅读次数：
151
A boy named Gena really wants to get to the “Russian Code Cup” finals, or at least get a t-shirt. But the offered problems are too complex, so he made an arrangement with his n friends that they will s...
分类：
编程语言 时间：
2015-03-16 14:36:02
阅读次数：
141
A boy named Gena really wants to get to the "Russian Code Cup" finals, or at least get a t-shirt. But the offered problems are too complex, so he made an arrangement with his n friends
that they wil...
分类：
其他好文 时间：
2015-03-15 23:05:06
阅读次数：
277
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,...
分类：
其他好文 时间：
2015-03-15 13:42:18
阅读次数：
118
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,...
分类：
其他好文 时间：
2015-03-15 02:00:27
阅读次数：
116
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]...
分类：
其他好文 时间：
2015-03-14 10:59:57
阅读次数：
122
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 th...
分类：
其他好文 时间：
2015-03-13 23:49:17
阅读次数：
249
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-03-13 00:28:08
阅读次数：
187
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] has the largest sum = 6....
分类：
其他好文 时间：
2015-03-12 22:42:13
阅读次数：
158
