-
Notifications
You must be signed in to change notification settings - Fork 1
/
Copy path146_LRU_cache.py
71 lines (57 loc) · 1.82 KB
/
146_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
62
63
64
65
66
67
68
69
class Node:
def __init__(self, key, value) -> None:
self.key = key
self.value = value
self.next = None
self.prev = None
def __repr__(self) -> str:
return str(self.value)
class LRUCache:
def __init__(self, capacity: int) -> None:
self.capacity = capacity
self.dict = {}
self.head = Node('head', 'start')
self.tail = Node('tail', 'finish')
self.head.next = self.tail
self.tail.prev = self.head
def insert_before(self, new_node) -> None:
head = self.head.next
new_node.prev = head.prev
new_node.next = head
head.prev = new_node
self.head.next = new_node
def remove_node(self, node) -> None:
prev_node = node.prev
next_node = node.next
prev_node.next = next_node
next_node.prev = prev_node
def get(self, key: int) -> int:
if key in self.dict.keys():
node = self.dict[key]
value = node.value
self.remove_node(node)
self.insert_before(node)
return value
return -1
def put(self, key: int, value: int) -> None:
if key in self.dict.keys():
node = self.dict[key]
node.value = value
self.remove_node(node)
self.insert_before(node)
else:
if len(self.dict) >= self.capacity:
node = self.tail.prev
del self.dict[node.key]
self.remove_node(node)
new_node = Node(key, value)
self.insert_before(new_node)
self.dict[key] = new_node
lRUCache = LRUCache(2)
lRUCache.put(2, 1)
lRUCache.put(1, 1)
lRUCache.put(2, 3)
lRUCache.put(4, 1)
print(lRUCache.dict)
print(lRUCache.get(1))
print(lRUCache.get(2))