Least Recently Used(LRU) Cache

最新推荐文章于 2024-09-19 22:26:19 发布

bonny95

最新推荐文章于 2024-09-19 22:26:19 发布

阅读量944

点赞数

CC 4.0 BY-SA版权

本文链接：https://blog.youkuaiyun.com/bonny95/article/details/39250807

本文探讨了如何设计和实现一种最小最近最少使用(LRU)缓存数据结构。该结构支持get和set操作，get操作获取指定键的值，若不存在则返回-1；set操作设置或插入值，当缓存满时会移除最不常使用的项。文章还讨论了使用哈希映射(map或unordered_map)处理(key, value)对时的局限性。

摘要生成于 C知道，由 DeepSeek-R1 满血版支持，前往体验 >

According to LeetCode:

Design and implement a data structure for Least Recently Used (LRU) cache. It should support the following operations: get and set.

get(key) - Get the value (will always be positive) of the key if the key exists in the cache, otherwise return -1.

set(key, value) - Set or insert the value if the key is not already present. When the cache reached its capacity, it should invalidate the least recently used item before inserting a new item.

When dealing with (key, vlaue) pairs, the most straight-forward data structure is hashmap(map or unordered_map in C++). However, at least for C++, it is difficult to control the insertion of new items: (1) the position you can specify is just a hint and does not force the new element to be inserted at that position within the map/unordered_map container, and (2) there is no push_back or push_front methods provided for map/unordered_map.

- See more at: http://bo-yang.github.io/2014/06/12/lru-cache/#sthash.Pj0d5XQ1.dpuf

http://bo-yang.github.io/2014/06/12/lru-cache