-
Notifications
You must be signed in to change notification settings - Fork 0
Expand file tree
/
Copy pathStack.py
More file actions
47 lines (44 loc) · 1.46 KB
/
Stack.py
File metadata and controls
47 lines (44 loc) · 1.46 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
44
45
46
47
### Class Stack of integers ###
# Stack that only holds integers
class intStack(object):
def __init__(self):
self.state = []
def push(self, element):
'''Adds an element to the top of a stack'''
assert type(element) == self.elemType
self.state.append(element)
def empty(self):
'''True iff stack is empty'''
return len(self.state) == 0
def pop(self):
'''Removes the top of a nonempty stack'''
if not self.empty():
self.state.pop()
def top(self):
'''Returns the top of a nonempty stack'''
if self.empty():
raise ValueError("Reuested top of an empty Stack!!")
else:
return self.state[-1]
# Most of the time, we are doing this:
# Parameterized Stack:
class Stack(object):
def __init__(self,type):
self.elemenType = type
self.state = []
def push(self, element):
'''Adds an element to the top of a stack'''
self.state.append(element)
def empty(self):
'''True iff stack is empty'''
return len(self.state) == 0
def pop(self):
'''Removes the top of a nonempty stack'''
if not self.empty():
self.state.pop()
def top(self):
'''Returns the top of a nonempty stack'''
if self.empty():
raise ValueError("Reuested top of an empty Stack!!")
else:
return self.state[-1]