运用你所掌握的数据结构,设计和实现一个LRU (最近最少使用) 缓存机制。它应该支持以下操作: 获取数据 get 和 写入数据 write。
获取数据 get(key) - 如果key存在于缓存中,则获取key的值(总是正数),否则返回 -1。
写入数据 write(key, value) - 如果key不存在,则写入其数据值。当缓存容量达到上限时,它应该在写入新数据之前删除最久未使用的数据值,从而为新的数据值留出空间。
class LinkNode():
def __init__(self):
self.key = 0
self.value = 0
self.prev = None
self.next = None
class LRUCache():
def __init__(self, capacity):
self.cache = {}
self.size = 0
self.capacity = capacity
self.head = LinkNode()
self.tail = LinkNode()
self.head.next = self.tail
self.tail.prev = self.head
def _add_node(self, node):
node.prev = self.head
node.next = self.head.next
self.head.next.prev = node
self.head.next = node
def _remove_node(self, node):
prev = node.prev
new = node.next
prev.next = new
new.prev = prev
def _move_to_head(self, node):
self._remove_node(node)
self._add_node(node)
def _pop_tail(self):
res = self.tail.prev
self._remove_node(res)
return res
def get(self, key):
node = self.cache.get(key, None)
if not node:
return -1
self._move_to_head(node)
return node.value
def write(self, key, value):
node = self.cache.get(key)
if not node:
newNode = LinkNode()
newNode.key = key
newNode.value = value
self.cache[key] = newNode
self._add_node(newNode)
self.size += 1
if self.size > self.capacity:
tail = self._pop_tail()
del self.cache[tail.key]
self.size -= 1
else:
node.value = value
self._move_to_head(node)
cache = LRUCache(2);
cache.write(1, 1)
cache.write(2, 2)
value1 = cache.get(1)
value2 = cache.write(3, 3)
value3 = cache.get(2)
value4 = cache.write(4, 4)
value5 = cache.get(1)
value6 = cache.get(3)
value7 = cache.get(4)