GoLang Solution For LeetCode Problem: Implement Queue using Stacks
Solving Implement Queue using Stacks in go. Please try yourself first to solve the problem and submit your implementation to LeetCode before looking into solution.
Implement the following operations of a queue using stacks.
- push(x) -- Push element x to the back of queue.
- pop() -- Removes the element from in front of queue.
- peek() -- Get the front element.
- empty() -- Return whether the queue is empty.
MyQueue queue = new MyQueue(); queue.push(1); queue.push(2); queue.peek(); // returns 1 queue.pop(); // returns 1 queue.empty(); // returns false
- You must use only standard operations of a stack -- which means only push to top, peek/pop from top, size, and is empty operations are valid.
- Depending on your language, stack may not be supported natively. You may simulate a stack by using a list or deque (double-ended queue), as long as you use only standard operations of a stack.
- You may assume that all operations are valid (for example, no pop or peek operations will be called on an empty queue).
See the full details of the problem Implement Queue using Stacks at LeetCode
Originally posted at: @github.com/halfrost/LeetCode-Go