-
Notifications
You must be signed in to change notification settings - Fork 0
Expand file tree
/
Copy pathstack.py
More file actions
44 lines (34 loc) · 1.28 KB
/
stack.py
File metadata and controls
44 lines (34 loc) · 1.28 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
# Created by Roshan Jayswal on 19/05/2020.
# Copyright © 2021. All rights reserved.
class MultiStack:
def __init__(self, stacksize):
self.numstacks = 3
self.array = [0] * (stacksize * self.numstacks)
self.sizes = [0] * self.numstacks
self.stacksize = stacksize
# print(self.array)
# print(self.sizes)
def Push(self, item, stacknum):
if self.IsFull(stacknum):
raise Exception('Stack is full')
self.sizes[stacknum] += 1
self.array[self.IndexOfTop(stacknum)] = item
def Pop(self, stacknum):
if self.IsEmpty(stacknum):
raise Exception('Stack is empty')
value = self.array[self.IndexOfTop(stacknum)]
self.array[self.IndexOfTop(stacknum)] = 0
self.sizes[stacknum] -= 1
return value
def Peek(self, stacknum):
if self.IsEmpty(stacknum):
raise Exception('Stack is empty')
return self.array[self.IndexOfTop(stacknum)]
def IsEmpty(self, stacknum):
return self.sizes[stacknum] == 0
def IsFull(self, stacknum):
return self.sizes[stacknum] == self.stacksize
def IndexOfTop(self, stacknum):
offset = stacknum * self.stacksize
return offset + self.sizes[stacknum] - 1
stack = MultiStack(1)