OpenSoure_Repos/TheAlgorithms-Python
1
0
Fork 0
mirror of https://hub.njuu.cf/TheAlgorithms/Python.git synced 2023-10-11 13:06:12 +08:00
Code Issues Packages Projects Releases Wiki Activity

[pre-commit.ci] auto fixes from pre-commit.com hooks

Browse Source 
for more information, see https://pre-commit.ci
This commit is contained in:
pre-commit-ci[bot] 2023-10-08 13:07:33 +00:00
parent ed1df8f539
commit 85ac78ed08
1 changed files with 53 additions and 61 deletions
Show Stats Download Patch File Download Diff File Expand all files Collapse all files

114
data_structures/stacks/stack_by_two_queues.py
View File

@ -4,75 +4,67 @@ from typing import Generic, TypeVar
T = TypeVar("T")
""" Implementing stack using two arrays"""
class Stack(Generic[T]):#Stack class to implement stack operations
def __init__(self) :
self.insert_queue=deque() # First Queue to be used for inserting
self.second_queue=deque() # Second Queue to be used
def push(self,item:int) :
class Stack(Generic[T]): # Stack class to implement stack operations
def __init__(self):
self.insert_queue = deque() # First Queue to be used for inserting
self.second_queue = deque() # Second Queue to be used
def push(self, item: int):
self.insert_queue.append(item)
while(self.second_queue):
self.insert_queue.append(self.second_queue.popleft()) # Popping the elements
self.insert_queue,self.second_queue=self.second_queue,self.insert_queue
def pop(self) ->int :
if not self.second_queue: # if the stack is empty
while self.second_queue:
self.insert_queue.append(
self.second_queue.popleft()
) # Popping the elements
self.insert_queue, self.second_queue = self.second_queue, self.insert_queue
def pop(self) -> int:
if not self.second_queue: # if the stack is empty
return None
return(self.second_queue.popleft()) # if not empty pop
return self.second_queue.popleft() # if not empty pop
def top(self) -> int:
if not self.second_queue:
return None
return(self.second_queue[0])
return self.second_queue[0]
def __str__(self) -> str:
return tuple(self.second_queue)
def __len__(self) -> int:
return len(self.second_queue)
def test_stack() -> None:
stack = Stack() # Creating a empty stack
choice=int(input("1 to push,2 to pop,3 to peek ,4 to print, 5 for size,6 to exit:"))
while (choice in (1, 2, 3, 4, 5, 6)):
match(choice):
case 1:
element=int(input("Enter the element to push:"))
stack.push(element)
case 2:
print(stack.pop())
case 3:
print(stack.top())
case 4:
print(stack.__str__())
case 5:
leng=stack.__len__()
print(f"The size of the stack is {leng}")
case 6:
print("Exiting")
break
case _:
print("Enter properly")
choice=int(input("1 to push,2 to pop,3 to peek ,4 to print, 5 for size,6 to exit:"))
if __name__=="__main__":
test_stack() # calling the test function
stack = Stack() # Creating a empty stack
choice = int(
input("1 to push,2 to pop,3 to peek ,4 to print, 5 for size,6 to exit:")
)
while choice in (1, 2, 3, 4, 5, 6):
match (choice):
case 1:
element = int(input("Enter the element to push:"))
stack.push(element)
case 2:
print(stack.pop())
case 3:
print(stack.top())
case 4:
print(stack.__str__())
case 5:
leng = stack.__len__()
print(f"The size of the stack is {leng}")
case 6:
print("Exiting")
break
case _:
print("Enter properly")
choice = int(
input("1 to push,2 to pop,3 to peek ,4 to print, 5 for size,6 to exit:")
)
if __name__ == "__main__":
test_stack() # calling the test function