LC-0232 Easy LeetCode

232. Implement Queue using Stacks

Read the full problem statement on LeetCode.

Difficulty: easy Acceptance: 68% Topics: Stack, Design, Queue

Reading material

Stacks & Queues 11 min Design (Data Structures) 14 min

Reference solution (spoiler · python)

# Time:  O(1), amortized
# Space: O(n)

class MyQueue(object):

    def __init__(self):
        self.A, self.B = [], []

    def push(self, x):
        """
        :type x: int
        :rtype: None
        """
        self.A.append(x)

    def pop(self):
        """
        :rtype: int
        """
        self.peek()
        return self.B.pop()

    def peek(self):
        """
        :rtype: int
        """
        if not self.B:
            while self.A:
                self.B.append(self.A.pop())
        return self.B[-1]

    def empty(self):
        """
        :rtype: bool
        """
        return not self.A and not self.B

Solution from kamyu104/LeetCode-Solutions · MIT