Skip to content

Feature/stack using two queues #10086

New issue

Have a question about this project? Sign up for a free GitHub account to open an issue and contact its maintainers and the community.

By clicking “Sign up for GitHub”, you agree to our terms of service and privacy statement. We’ll occasionally send you account related emails.

Already on GitHub? Sign in to your account

3 changes: 2 additions & 1 deletion .vscode/settings.json
Original file line number Diff line number Diff line change
@@ -1,5 +1,6 @@
{
"githubPullRequests.ignoredPullRequestBranches": [
"master"
]
],
"python.analysis.typeCheckingMode": "basic"
}
72 changes: 72 additions & 0 deletions data_structures/stacks/TwoQueuedStack.py
Original file line number Diff line number Diff line change
@@ -0,0 +1,72 @@
class StackUsingQueues:
def __init__(self) -> None:
"""
Initialize the stack using two queues.

>>> stack = StackUsingQueues()
"""
self.queue1 = []
self.queue2 = []

def push(self, item) -> None:

Choose a reason for hiding this comment

The reason will be displayed to describe this comment to others. Learn more.

Please provide type hint for the parameter: item

"""
Push an item onto the stack.

>>> stack = StackUsingQueues()
>>> stack.push(1)
>>> stack.push(2)
>>> stack.push(3)
>>> stack.peek()
3
"""
while len(self.queue1) != 0:
self.queue2.append(self.queue1[0])
self.queue1.pop(0)
self.queue1.append(item)
while len(self.queue2) != 0:
self.queue1.append(self.queue2[0])
self.queue2.pop(0)

def pop(self) -> int:
"""
Pop the top item from the stack and return it.

>>> stack = StackUsingQueues()
>>> stack.push(1)
>>> stack.push(2)
>>> stack.pop()
2
>>> stack.pop()
1
>>> stack.pop()
0
"""
if len(self.queue1) != 0:
popped = self.queue1.pop(0)
return popped
else:
return 0

def peek(self) -> int:
"""
Return the top item from the stack without removing it.

>>> stack = StackUsingQueues()
>>> stack.push(1)
>>> stack.push(2)
>>> stack.peek()
2
>>> stack.pop()
2
>>> stack.peek()
1
>>> stack.pop()
1
>>> stack.peek()
0
"""
if len(self.queue1) != 0:
return self.queue1[0]
else:
return 0