-
Notifications
You must be signed in to change notification settings - Fork 5
/
Copy pathfinal_deque.py
73 lines (57 loc) · 1.85 KB
/
final_deque.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
70
71
72
73
"""ID посылки: 87911435."""
class DequeFullError(Exception):
pass
class DequeEmptyError(Exception):
pass
class Deque:
def __init__(self, max_size: int):
self._max_size = max_size
self._deque: list[int | None] = [None] * max_size
self._first = 1
self._last = 0
self._size = 0
def _check_full(self):
if self._size == self._max_size:
msg = 'Max deque size reached'
raise DequeFullError(msg)
def _check_empty(self):
if self._size == 0:
msg = 'Deque is empty'
raise DequeEmptyError(msg)
def push_front(self, value: int):
self._check_full()
self._first = (self._first - 1) % self._max_size
self._deque[self._first] = value
self._size += 1
def push_back(self, value: int):
self._check_full()
self._last = (self._last + 1) % self._max_size
self._deque[self._last] = value
self._size += 1
def pop_front(self):
self._check_empty()
value = self._deque[self._first]
self._first = (self._first + 1) % self._max_size
self._size -= 1
return value
def pop_back(self):
self._check_empty()
value = self._deque[self._last]
self._last = (self._last - 1) % self._max_size
self._size -= 1
return value
def main():
command_count = int(input())
max_size = int(input())
deque = Deque(max_size)
for _ in range(command_count):
method_name, *method_args = input().split()
method_args = map(int, method_args)
try:
return_value = getattr(deque, method_name)(*method_args)
if return_value is not None:
print(return_value)
except (DequeFullError, DequeEmptyError):
print('error')
if __name__ == '__main__':
main()