LeetCode Implement Queue using Stacks

题目:

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 toppeek/pop from topsize, 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).
  • 就是使用一个双栈来实现一个队列,可以使用栈的一些个方法,例如push或者是top等方法。
题意:



代码:

class MyQueue 
{
    Stack<Integer> stack1 = new Stack<Integer>();
    Stack<Integer> stack2 = new Stack<Integer>();
    // Push element x to the back of queue.
    public void push(int x) 
    {
        if(!stack1.isEmpty())            //这里的判断第一个栈是否为空
            stack1.push(x);
        else                                    //如果第一个栈为空,那么就要从第二个栈中的数据压入第一个栈中
        {
            while(!stack2.isEmpty())
                stack1.push(stack2.pop());
            stack1.push(x);
        }
    }

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

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

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


  • 0
    点赞
  • 0
    收藏
    觉得还不错? 一键收藏
  • 0
    评论

“相关推荐”对你有帮助么?

  • 非常没帮助
  • 没帮助
  • 一般
  • 有帮助
  • 非常有帮助
提交
评论
添加红包

请填写红包祝福语或标题

红包个数最小为10个

红包金额最低5元

当前余额3.43前往充值 >
需支付:10.00
成就一亿技术人!
领取后你会自动成为博主和红包主的粉丝 规则
hope_wisdom
发出的红包
实付
使用余额支付
点击重新获取
扫码支付
钱包余额 0

抵扣说明:

1.余额是钱包充值的虚拟货币,按照1:1的比例进行支付金额的抵扣。
2.余额无法直接购买下载,可以购买VIP、付费专栏及课程。

余额充值