-
Notifications
You must be signed in to change notification settings - Fork 361
/
Copy pathDIVIDE THE LIST INTO THREE STACKS.py
48 lines (40 loc) · 1.39 KB
/
DIVIDE THE LIST INTO THREE STACKS.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
# PYTHON CODE TO DIVIDE THE LIST INTO THREE STACKS
class MultiStack:
def __init__(self,stacksize):
self.numberstacks=3
self.custList=[0]*(stacksize*self.numberstacks)
self.sizes=[0]*self.numberstacks
self.stacksize=stacksize
def isFull(self,stacknum):
if self.sizes[stacknum]==self.stacksize:
return True
else:
return False
def isEmpty(self,stacknum):
if self.sizes[stacknum]==0:
return True
else:
return False
def indexOfTop(self,stacknum):
offset=stacknum*self.stacksize
return offset+self.sizes[stacknum]-1
def push(self,item,stacknum):
if self.isFull(stacknum):
return "stack is full"
else:
self.sizes[stacknum]+=1
self.custList[self.indexOfTop(stacknum)]=item
def pop(self,stacknum):
if self.isEmpty(stacknum):
return "stack is empty"
else:
value = self.custList[self.indexOfTop(stacknum)]
self.custList[self.indexOfTop(stacknum)]=0
self.sizes[stacknum]-=1
return value
def pop(self,stacknum):
if self.isEmpty(stacknum):
return "stack is empty"
else:
value = self.custList[self.indexOfTop(stacknum)]
return value