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 4628c0b commit e4acd61Copy full SHA for e4acd61
docs/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
0 commit comments