-
Notifications
You must be signed in to change notification settings - Fork 0
Expand file tree
/
Copy pathtwo_stack_queue.py
More file actions
78 lines (62 loc) · 1.81 KB
/
two_stack_queue.py
File metadata and controls
78 lines (62 loc) · 1.81 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
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
""" Implement a queue using two stacks
"""
class Stack(object):
def __init__(self):
self._stack_list = []
def peek(self):
if self.is_empty():
return None
else:
return self._stack_list[-1]
def push(self, value):
self._stack_list.append(value)
def pop(self):
if self.is_empty():
return None
else:
value = self._stack_list.pop()
return value
def is_empty(self):
return len(self._stack_list) == 0
class doubleStackQueue(object):
def __init__(self):
self._stack_A = Stack()
self._stack_B = Stack()
def enqueue(self, item):
self._stack_A.push(item)
def dequeue(self):
if self.is_empty():
return None
else:
while not self._stack_A.is_empty():
self._stack_B.push(self._stack_A.pop())
value = self._stack_B.pop()
while not self._stack_B.is_empty():
self._stack_A.push(self._stack_B.pop())
return value
def peek(self):
if self.is_empty():
return None
else:
while not self._stack_A.is_empty():
self._stack_B.push(self._stack_A.pop())
value = self._stack_B.peek()
while not self._stack_B.is_empty():
self._stack_A.push(self._stack_B.pop())
return value
def is_empty(self):
return self._stack_A.is_empty()
test_queue = doubleStackQueue()
test_queue.enqueue(7)
test_queue.enqueue(8)
test_queue.enqueue(9)
test_queue.enqueue(10)
test_queue.enqueue(11)
test_queue.enqueue(12)
test_queue.enqueue(13)
test_queue.enqueue(14)
test_queue.enqueue(15)
print test_queue.dequeue()
print test_queue.dequeue()
print test_queue.dequeue()
print test_queue.peek()