LeetCode-232.Implement Queue using Stacks

https://leetcode.com/problems/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).

用栈实现队列

class Queue 
{
public:
    stack<int> in,out;
    // Push element x to the back of queue.
    void push(int x) 
    {
        in.push(x);
    }

    // Removes the element from in front of queue.
    void pop(void)
    {
        peek();
	    out.pop();
    }

    // Get the front element.
    int peek(void) 
    {
        if (out.empty())
    	{
    		while (!in.empty())
    		{
    			out.push(in.top());
    			in.pop();
    		}
    	}
    	return out.top();
    }

    // Return whether the queue is empty.
    bool empty(void)
    {
        return in.empty()&&out.empty();
    }
};


评论
添加红包

请填写红包祝福语或标题

红包个数最小为10个

红包金额最低5元

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

抵扣说明:

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

余额充值