implement a queue by using two stacks [No. 31]

For a queue, we need to implement enqueue and dequeue methods.

The idea is if we perform enqueue operation, we simply put that input into the stack 1 by performing the push operation; when we perform dequeue, as the first item is at the bottom of the stack, we need to use the second stack to reverse the order. Therefore, after the reverse, we can pop the first item in the stack 2. Next time, when we perform enqueue, we keep pushing the input into the stack 1, but do dequeue operation, we need to check whether the stack 2 is empty, if it is not empty, we need to pop it out as the first item in the queue.

public class Test {
	
	Stack<Integer> stack1; 
	Stack<Integer> stack2;
	
	public Test() { 
		stack1 = new Stack<Integer>();
		stack2 = new Stack<Integer>();
	}
	
	public void enqueue (int value) {
		stack1.push(value);
	}
	
	public Object dequeue() {
		
		/*
		 * If the stack2 is not empty, then the top one must be the first one in the queue 
		 */
		if (stack2.empty() == false) {
			return stack2.pop();
		}
		
		/*
		 * If the stack2 is empty, we need to get the enqueued data from stack 1
		 */
		
		if (stack1.empty() == false) {
			stack2.push(stack1.pop());
		}
		
		/*
		 * after finishing getting the data from stack1, we shoud pop the fist item in stack2
		 */
		return stack2.pop();
	}

}