-
Notifications
You must be signed in to change notification settings - Fork 0
/
Copy pathlru_cache.py
61 lines (54 loc) · 1.46 KB
/
lru_cache.py
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
class Node:
def __init__(self, key, value):
self.key = key
self.value = value
self.prev = None
self.next = None
class LRUCache(object):
def __init__(self, capacity):
"""
:type capacity: int
"""
self.capacity = capacity
self.dict = dict()
self.head = Node(0, 0)
self.tail = Node(0, 0)
self.head.next = self.tail
self.tail.prev = self.head
def remove(self, node):
prev = node.prev
next = node.next
prev.next = next
next.prev = prev
def add(self, node):
prev = self.tail.prev
prev.next = node
self.tail.prev = node
node.prev = prev
node.next = self.tail
def get(self, key):
"""
:type key: int
:rtype: int
"""
if key in self.dict:
node = self.dict[key]
self.remove(node)
self.add(node)
return node.value
return -1
def put(self, key, value):
"""
:type key: int
:type value: int
:rtype: void
"""
if key in self.dict:
self.remove(self.dict[key])
node = Node(key, value)
self.add(node)
self.dict[key] = node
if len(self.dict) > self.capacity:
node = self.head.next
self.remove(node)
del self.dict[node.key]