-
Notifications
You must be signed in to change notification settings - Fork 0
/
Copy pathQueueusingStack_efficient.py
93 lines (59 loc) · 2 KB
/
QueueusingStack_efficient.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
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
import unittest
class QueueTwoStacks(object):
# Implement the enqueue and dequeue methods
def __init__(self):
self.stack1 = []
self.stack2 = []
def enqueue(self, item):
#if not self.stack1 :
# self.stack2.append(item)
#if not self.stack2 :
# self.stack1.append(item)
self.stack1.append(item)
def dequeue(self):
#if not self.stack1 :
# while self.stack2 :
# self.stack1.append(self.stack2.pop())
# item = self.stack1.pop()
# while self.stack1 :
# self.stack2.append(self.stack1.pop())
# return item
if not self.stack1 and not self.stack2 :
raise Exception
if not self.stack2: # if tack 2 is empty
while self.stack1:
self.stack2.append(self.stack1.pop())
#return self.stack2.pop()
#else: # stack2 is not empty the return first element on stack2
#return self.stack2.pop()
return self.stack2.pop()
#if not self.stack2 :
# while self.stack1 :
# self.stack2.append(self.stack1.pop())
# item = self.stack2.pop()
# while self.stack2 :
# self.stack1.append(self.stack2.pop())
# return item
# Tests
class Test(unittest.TestCase):
def test_queue_usage(self):
queue = QueueTwoStacks()
queue.enqueue(1)
queue.enqueue(2)
queue.enqueue(3)
actual = queue.dequeue()
expected = 1
self.assertEqual(actual, expected)
actual = queue.dequeue()
expected = 2
self.assertEqual(actual, expected)
queue.enqueue(4)
actual = queue.dequeue()
expected = 3
self.assertEqual(actual, expected)
actual = queue.dequeue()
expected = 4
self.assertEqual(actual, expected)
with self.assertRaises(Exception):
queue.dequeue()
unittest.main(verbosity=2)