forked from The-Open-Source-Society/Algo_Ds_Notes
-
Notifications
You must be signed in to change notification settings - Fork 1
/
Stack.py
71 lines (52 loc) · 1.24 KB
/
Stack.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
class Queue:
def __init__(self):
self.data = collections.deque()
def push(self, x):
self.data.append(x)
def peek(self):
return self.data[0]
def pop(self):
return self.data.popleft()
def size(self):
return len(self.data)
def empty(self):
return len(self.data) == 0
class Stack:
def __init__(self):
self.q_ = Queue()
def push(self, x):
self.q_.push(x)
for _ in xrange(self.q_.size() - 1):
self.q_.push(self.q_.pop())
def pop(self):
self.q_.pop()
def top(self):
return self.q_.peek()
def empty(self):
return self.q_.empty()
class Stack2:
def __init__(self):
self.q_ = Queue()
self.top_ = None
def push(self, x):
self.q_.push(x)
self.top_ = x
def pop(self):
for _ in xrange(self.q_.size() - 1):
self.top_ = self.q_.pop()
self.q_.push(self.top_)
self.q_.pop()
def top(self):
return self.top_
def empty(self):
return self.q_.empty()
s1 = Stack()
s2 = Stack2()
print(s1.empty())
print(s2.empty())
s1.push(1)
s2.push(2)
print(s1.top())
print(s2.top())
s1.pop()
s2.pop()