Redid Lists as Stacks and Queues - Exercise #17

Author: MitkoVtori

Advanced/1.Stacks, Queues, Tuples and Sets/Lists as Stacks and Queues - Exercise/01. Reverse Numbers.py

@@ -18,10 +18,5 @@ def count(self):
 
 reverse_integers = Stack()
 
-integers = [int(num) for num in input().split()]
-
-for number in integers:
-    reverse_integers.push(number)
-
-while reverse_integers.count():
-    print(reverse_integers.pop(), end=' ')
+[reverse_integers.push(int(num)) for num in input().split()]
+[print(reverse_integers.pop(), end=" ") for _ in range(reverse_integers.count())]

Advanced/1.Stacks, Queues, Tuples and Sets/Lists as Stacks and Queues - Exercise/02. Stacked Queries.py

@@ -16,30 +16,31 @@ def count(self):
         return len(self.stack)
 
 
-numbers_stack = Stack()
+stack = Stack()
+numbers_list = []
 
-lines_of_input = int(input())
+lines = int(input())
 
-min_max_num = []
+for queries in range(lines):
+    query = input()
 
-for num in range(lines_of_input):
-    number = input().split()
+    if query.startswith("1"):
+        num = int(query.split()[1])
+        stack.push(num)
+        numbers_list.append(num)
 
-    if number[0] == '1':
-        numbers_stack.push(number[1])
-        min_max_num.append(int(number[1]))
+    elif query == "2":
+        if stack.count():
+            stack.pop()
+            numbers_list.pop()
 
-    elif numbers_stack.count():
-        if number[0] == '2':
-            numbers_stack.pop()
-            min_max_num.pop()
+    elif query == "3":
+        if stack.count():
+            print(max(numbers_list))
 
-        elif number[0] == '3':
-            print(max(min_max_num))
+    elif query == "4":
+        if stack.count():
+            print(min(numbers_list))
 
-        elif number[0] == '4':
-            print(min(min_max_num))
 
-numbers = [str(num) for num in min_max_num[::-1]]
-
-print(', '.join(numbers))
+print(", ".join([str(stack.pop()) for _ in range(stack.count())]))

Advanced/1.Stacks, Queues, Tuples and Sets/Lists as Stacks and Queues - Exercise/03. Fast Food.py

@@ -1,30 +1,19 @@
 from collections import deque
 
-quantity_food = int(input())
-orders_food_quantity = deque([int(num) for num in input().split()])
+food_quantity = int(input())
+orders = deque(map(int, input().split()))
+too_many_orders = False
 
-print(max(orders_food_quantity))
+print(max(orders))
 
-orders_complete = True
+for order in range(len(orders)):
+    if food_quantity - orders[0] >= 0:
+        food_quantity -= orders.popleft()
 
-index = -1
-
-while orders_food_quantity:
-
-    index += 1
-    order = orders_food_quantity[index]
-
-    if order <= quantity_food:
-        index -= 1
-        quantity_food -= order
-        orders_food_quantity.popleft()
-
-    elif order > quantity_food:
-        orders_complete = False
+    else:
+        too_many_orders = True
+        print("Orders left:", ' '.join([str(order) for order in orders]))
         break
 
-if orders_complete:
-    print("Orders complete")
-elif not orders_complete:
-    uncompleted_orders = [str(num) for num in orders_food_quantity]
-    print(f"Orders left: {' '.join(uncompleted_orders)}")
+if not too_many_orders:
+    print('Orders complete')

Advanced/1.Stacks, Queues, Tuples and Sets/Lists as Stacks and Queues - Exercise/05. Truck Tour.py

@@ -9,7 +9,7 @@
 for attempt in range(number_petrol_pumps):
 
     trunk = 0
-    failed_attempt= False
+    failed_attempt = False
 
     for petrol, distance in pumps:
         trunk = trunk + petrol - distance
@@ -22,4 +22,4 @@
 
     elif not failed_attempt:
         print(attempt)
-        break
+        break

Advanced/1.Stacks, Queues, Tuples and Sets/Lists as Stacks and Queues - Exercise/06. Balanced Parentheses.py

@@ -16,9 +16,6 @@ def count(self):
         return len(self.stack)
 
 
-opening_brackets = ['{', '(', '[']
-closing_brackets = ['}', ')', ']']
-
 pairs = {
     '{': '}',
     '(': ')',
@@ -32,10 +29,10 @@ def count(self):
 
 for index, bracket in enumerate(parentheses):
 
-    if bracket in opening_brackets:
+    if bracket in pairs.keys():
         bracket_integers.push(index)
 
-    elif bracket in closing_brackets:
+    elif bracket in pairs.values():
         if bracket_integers.count():
 
             last_index = bracket_integers.peek()