-
[面试中 LRU / LFU 的青铜与王者](https://github.com/halfrost/Halfrost-Field/blob/master/contents/Go/LRU_LFU_interview.md) 这篇文章非常对应试技巧非常有帮助。
## LRU
LRU的数据结构大部分人都知道,即字典+链表。但有一些细节需要特别注意
1. 链表必须是双向链表,这样在移动时才…
-
-
-
Are there any plans of supporting different eviction policies, for example least frequently used?
-
The schemas loaded should be cached in a Least Frequently Used cache, so we don't need to parse and create the schema every time we need it.
-
https://leetcode.com/problems/lfu-cache/
Please assign this to me in C++
-
https://duckdb.org/2022/05/27/iejoin.html
https://interjectedfuture.com/lab-notes/lab-note-034-incremental-insertion-into-prolly-trees/
https://www.figma.com/blog/how-figmas-databases-team-lived…
-
Implement window-LFU eviction algorithm.
-
## [460. LFU Cache](https://leetcode.com/problems/lfu-cache/)
设计并实现`最不经常使用(LFU)`缓存的数据结构。它应该支持以下操作:`get` 和 `put`。
`get(key)` - 如果键存在于缓存中,则获取键的值(总是正数),否则返回 -1。
`put(key, value)`- 如果键不存在,请设置或插入值。当…
-
[缓存算法(FIFO 、LRU、LFU三种算法的区别)](https://www.cnblogs.com/hongdada/p/10406902.html)