你遇到过这个题吗?
实现一个LRU Cache。要求查询和插入都在O(1) 时间内完成。
遇到过?很正常。
没遇到?早晚会遇到。(鬼脸)
这是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.
根据操作系统所学:cache(缓存)可以帮助快速存取数据,但是容量小。
本题要求实现的是LRU cache,LRU的思