forked from TheAlgorithms/Python
- Notifications
You must be signed in to change notification settings - Fork 0
Expand file tree
/
Copy pathqueue_on_pseudo_stack.py
More file actions
Latest commit
58 lines (45 loc) · 1.51 KB
/
Copy pathqueue_on_pseudo_stack.py
File metadata and controls
58 lines (45 loc) · 1.51 KB
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
"""Queue represented by a pseudo stack (represented by a list with pop and append)"""
fromtypingimportAny
classQueue:
def__init__(self):
self.stack= []
self.length=0
def__str__(self):
printed="<"+str(self.stack)[1:-1] +">"
returnprinted
"""Enqueues {@code item}
@param item
item to enqueue"""
defput(self, item: Any) ->None:
self.stack.append(item)
self.length=self.length+1
"""Dequeues {@code item}
@requirement: |self.length| > 0
@return dequeued
item that was dequeued"""
defget(self) ->Any:
self.rotate(1)
dequeued=self.stack[self.length-1]
self.stack=self.stack[:-1]
self.rotate(self.length-1)
self.length=self.length-1
returndequeued
"""Rotates the queue {@code rotation} times
@param rotation
number of times to rotate queue"""
defrotate(self, rotation: int) ->None:
for_inrange(rotation):
temp=self.stack[0]
self.stack=self.stack[1:]
self.put(temp)
self.length=self.length-1
"""Reports item at the front of self
@return item at front of self.stack"""
deffront(self) ->Any:
front=self.get()
self.put(front)
self.rotate(self.length-1)
returnfront
"""Returns the length of this.stack"""
defsize(self) ->int:
returnself.length