Implement Queue using Stacks

1 题目描述

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.

Notes:

• 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).

题目出处： https://leetcode.com/problems/implement-queue-using-stacks/

2 解题思路

1.用两个栈模拟队列的操作：一个作为插入栈，一个作为弹出栈。关键是当弹出栈为空时，要将插入栈中的元素弹出并插入到弹出栈中。

3 源代码

package com.larry.easy;

import java.util.Stack;

public class ImplementQueueUsingStacks {
	//主要思想为：出入元素时，直接出入到sta1；
	//          弹出元素时，sta2不为空则直接弹出，为空则将sta1中的元素弹出到sta2
	private Stack<Integer> sta1 = new Stack<Integer>();//插入元素栈
	private Stack<Integer> sta2 = new Stack<Integer>();//弹出元素栈
	
	// Push element x to the back of queue.
    public void push(int x) {
        sta1.push(x);
    }

    // Removes the element from in front of queue.
    public void pop() {
        if(!sta2.isEmpty()) sta2.pop();
        else{
        	while(!sta1.isEmpty()) sta2.push(sta1.pop());
        	sta2.pop();
        }
    }

    // Get the front element.
    public int peek() {
    	if(!sta2.isEmpty()) return sta2.peek();
        else{
        	while(!sta1.isEmpty()) sta2.push(sta1.pop());
        	return sta2.peek();
        }
    }

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