stack.py (892B)
1 class Stack: 2 def __init__(self, size): 3 self.maxSize = size 4 self.pointer = -1 5 self.data = [] 6 7 def peek(self): 8 print(self.data[self.pointer]) 9 10 def push(self, element): 11 if self.pointer > self.maxSize: 12 exit(1) 13 else: 14 self.data.append(element) 15 self.pointer = self.pointer + 1 16 17 def pop(self): 18 self.data.pop() 19 self.pointer = self.pointer - 1 20 21 def isfull(self): 22 if len(self.data) == self.maxSize: 23 return True 24 else: 25 return False 26 27 def isempty(self): 28 if len(self.data) == 0: 29 return True 30 else: 31 return False 32 33 34 mystack = Stack(10) 35 36 myinternalstack = Stack(10) 37 38 for i in range(10): 39 myinternalstack.push("hello") 40 41 42 for i in range(10): 43 mystack.push(myinternalstack) 44 45 mystack.peek() 46 47