Leetcode Problem 232. Implement Queue using Stacks

232. Implement Queue using Stacks

Leetcode Solutions

Initialize two stacks, s1 and s2.
For push operation, push the element onto s1.
For pop operation, if s2 is empty, transfer all elements from s1 to s2 by popping from s1 and pushing onto s2. Then pop the top of s2.
If s2 is not empty, pop the top of s2 directly.
For peek operation, if s2 is empty, transfer all elements from s1 to s2 and return the top of s2. If s2 is not empty, return the top of s2.
For empty operation, check if both s1 and s2 are empty. If both are empty, the queue is empty.

Programming Language

Purpose:

General Question

Debug My Code

image/screenshot of info(optional)

Full Screen