-
Notifications
You must be signed in to change notification settings - Fork 0
/
Copy pathLRUCache.py
46 lines (35 loc) · 1.22 KB
/
LRUCache.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
class LRUCache:
def __init__(self, capacity: int):
self.queue = deque([])
self.dict_ = {}
self.capacity = capacity
self.size = 0
def makeRecent(self, val):
self.queue.remove(val)
self.queue.append(val)
def get(self, key: int) -> int:
if key not in self.dict_:
return -1
else:
self.makeRecent(key)
return self.dict_[key]
def put(self, key: int, value: int) -> None:
if key in self.dict_:
self.makeRecent(key)
self.dict_[key] = value
else:
if self.size < self.capacity:
self.queue.append(key)
self.size += 1
self.dict_[key] = value
else:
if self.queue:
cur = self.queue[0]
self.queue.popleft()
del self.dict_[cur]
self.dict_[key] = value
self.queue.append(key)
# Your LRUCache object will be instantiated and called as such:
# obj = LRUCache(capacity)
# param_1 = obj.get(key)
# obj.put(key,value)