We read every piece of feedback, and take your input very seriously.
To see all available qualifiers, see our documentation.
There was an error while loading. Please reload this page.
1 parent 0ab560b commit 0f40726Copy full SHA for 0f40726
15_堆与堆排序/lfu.py
@@ -0,0 +1,6 @@
1
+"""
2
+https://medium.com/@epicshane/a-python-implementation-of-lfu-least-frequently-used-cache-with-o-1-time-complexity-e16b34a3c49b
3
+https://leetcode.com/problems/lfu-cache/
4
+
5
+这里学习下 LRU(least frequently used),就是当缓存满了之后剔除一个最少使用的 key。
6
index.html
@@ -581,5 +581,5 @@ <h2 id="_21">本电子书制作和写作方式</h2>
581
582
<!--
583
MkDocs version : 1.0.4
584
-Build Date UTC : 2018-12-24 05:05:56
+Build Date UTC : 2018-12-24 10:49:23
585
-->
sitemap.xml.gz
0 Bytes
0 commit comments