8000
We read every piece of feedback, and take your input very seriously.
To see all available qualifiers, see our documentation.
There was an error while loading. Please reload this page.
2 parents 26b6d18 + b61c19b commit e9ff0d5Copy full SHA for e9ff0d5
course_contents/21_algorithms_data_structures/projects/samples/stack.py
@@ -6,12 +6,12 @@ def push(self, e):
6
self.items = [e] + self.items
7
8
def pop(self):
9
- return self.items.pop()
+ return self.items.pop(0)
10
11
12
s = Stack()
13
s.push(5) # [5]
14
s.push(7) # [7, 5]
15
s.push(11) # [11, 7, 5]
16
print(s.pop()) # returns 11, left is [7, 5]
17
-print(s.pop()) # returns 7, left is [5]
+print(s.pop()) # returns 7, left is [5]
0 commit comments