LeetCode - Easy - 225. Implement Stack using Queues

Topic

• Stack
• Design

Description

https://leetcode.com/problems/implement-stack-using-queues/

Implement a last in first out (LIFO) stack using only two queues. The implemented stack should support all the functions of a normal queue (push, top, pop, and empty).

Implement the MyStack class:

• void push(int x) Pushes element x to the top of the stack.
• int pop() Removes the element on the top of the stack and returns it.
• int top() Returns the element on the top of the stack.
• boolean empty() Returns true if the stack is empty, false otherwise.

Notes:

• You must use only standard operations of a queue, which means only push to back, peek/pop from front, size, and is empty operations are valid.
• Depending on your language, the queue may not be supported natively. You may simulate a queue using a list or deque (double-ended queue), as long as you use only a queue’s standard operations.

Example 1:

Input
["MyStack", "push", "push", "top", "pop", "empty"]
[[], [1], [2], [], [], []]
Output
[null, null, null, 2, 2, false]

Explanation
MyStack myStack = new MyStack();
myStack.push(1);
myStack.push(2);
myStack.top(); // return 2
myStack.pop(); // return 2
myStack.empty(); // return False

Constraints:

• 1 <= x <= 9
• At most 100 calls will be made to push, pop, top, and empty.
• All the calls to pop and top are valid.

Follow-up: Can you implement the stack such that each operation is amortized O(1) time complexity? In other words, performing n operations will take overall O(n) time even if one of those operations may take longer. You can use more than two queues.

Analysis

方法一：用两个队列实现。

方法二：用一个队列实现。

Submission

import java.util.LinkedList;

//方法一：用两个队列实现
public class ImplementStackUsingQueues {

	private LinkedList<Integer> firstQueue;
	private LinkedList<Integer> secondQueue;

	/** Initialize your data structure here. */
	public ImplementStackUsingQueues() {
		firstQueue = new LinkedList<>();
		secondQueue = new LinkedList<>();
	}

	/** Push element x onto stack. */
	public void push(int x) {
		if(empty()) {
			firstQueue.offer(x);
			return;
		}
		
		if (!firstQueue.isEmpty())
			firstQueue.offer(x);
		else
			secondQueue.offer(x);
	}

	/** Removes the element on top of the stack and returns that element. */
	public int pop() {
		if (empty())
			throw new RuntimeException("Stack is empty");

		if(firstQueue.isEmpty()) {
			while(secondQueue.size() > 1) {
				firstQueue.offer(secondQueue.poll());
			}
			return secondQueue.poll();
		}else {
			while(firstQueue.size() > 1) {
				secondQueue.offer(firstQueue.poll());
			}
			return firstQueue.poll();
		}
	}

	/** Get the top element. */
	public int top() {
		if (empty())
			throw new RuntimeException("Stack is empty");
		if(firstQueue.isEmpty()) {
			while(secondQueue.size() > 1) {
				firstQueue.offer(secondQueue.poll());
			}
			Integer temp = secondQueue.poll();
			firstQueue.offer(temp);
			return temp;
		}else {
			while(firstQueue.size() > 1) {
				secondQueue.offer(firstQueue.poll());
			}
			Integer temp = firstQueue.poll();
			secondQueue.offer(temp);
			return temp;
		}
	}

	/** Returns whether the stack is empty. */
	public boolean empty() {
		return firstQueue.isEmpty() && secondQueue.isEmpty();
	}
}

//方法二：用一个队列实现
class MyStack {
	Queue<Integer> queue;

	public MyStack() {
		this.queue = new LinkedList<Integer>();
	}

	// Push element x onto stack.
	public void push(int x) {
		queue.add(x);
		for (int i = 0; i < queue.size() - 1; i++) {
			queue.add(queue.poll());
		}
	}

	// Removes the element on top of the stack.
	public int pop() {
		return queue.poll();
	}

	// Get the top element.
	public int top() {
		return queue.peek();
	}

	// Return whether the stack is empty.
	public boolean empty() {
		return queue.isEmpty();
	}
}

Test

import static org.junit.Assert.*;
import org.junit.Test;

public class ImplementStackUsingQueuesTest {

	@Test
	public void test1() {
		ImplementStackUsingQueues myStack = new ImplementStackUsingQueues();

		myStack.push(1);
		myStack.push(2);
		assertEquals(2, myStack.top()); // return 2
		assertEquals(2, myStack.pop()); // return 2
		assertFalse(myStack.empty()); // return False
	}

	@Test
	public void test2() {
		ImplementStackUsingQueues myStack = new ImplementStackUsingQueues();

		myStack.push(1);
		assertEquals(1, myStack.pop());
		assertTrue(myStack.empty()); // return False
	}

	@Test
	public void test3() {
		MyStack myStack = new MyStack();

		myStack.push(1);
		myStack.push(2);
		assertEquals(2, myStack.top()); // return 2
		assertEquals(2, myStack.pop()); // return 2
		assertFalse(myStack.empty()); // return False
	}

	@Test
	public void test4() {
		MyStack myStack = new MyStack();

		myStack.push(1);
		assertEquals(1, myStack.pop());
		assertTrue(myStack.empty()); // return False
	}
}