LeetCode-Implement Queue using Stacks-解题报告

原创 2015年07月07日 15:58:18

原题链接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 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).

用栈实现队列,这种题一般都是需要两个栈,当遇到出队或者回去队首元素的时候,将栈1中的元素push到栈2,然后返回栈2的栈顶。


class Queue {
public:
	// Push element x to the back of queue.
	void push(int x) {
		one.push(x);
	}

	// Removes the element from in front of queue.
	void pop(void) {
		if (!two.empty())
		{
			two.pop();
			return;
		}
		while (!one.empty())
		{
			two.push(one.top());
			one.pop();
		}
		if (!two.empty())two.pop();
	}

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

	// Return whether the queue is empty.
	bool empty(void) {
		return one.empty() && two.empty();
	}
private:
	stack<int>one;
	stack<int>two;
};


版权声明:

相关文章推荐

[Leetcode] 232. Implement Queue using Stacks 解题报告

题目: Implement the following operations of a queue using stacks. push(x) -- Push element x to...

LeetCode-Implement Stack using Queues-解题报告

LeetCode-Implement Stack using Queues-解题报告

【LeetCode】Implement Stack using Queues 解题报告

【题目】 Implement the following operations of a stack using queues. push(x) -- Push element x o...

[leetcode] 225. Implement Stack using Queues 解题报告

题目链接:https://leetcode.com/problems/implement-stack-using-queues/ Implement the following operation...

【leetcode】232. Implement Queue using Stacks

一、题目描述 Implement the following operations of a queue using stacks. push(x) -- Push element x...

LeetCode:Implement Queue using Stacks

LeetCode:Implement Queue using Stacks1、题目: Implement the following operations of a queue using stac...

LeetCode232 Implement Queue using Stacks Java 题解

题目: Implement the following operations of a queue using stacks. push(x) -- Push element x to...

LeetCode232—Implement Queue using Stacks

LeetCode232: Implement Queue using Stacks

LeetCode Implement Queue using Stacks

题目: Implement the following operations of a queue using stacks. push(x) -- Push element x to...

LeetCode 232 Implement Queue using Stacks(用栈来实现队列)(*)

翻译用栈来实现队列的下列操作。push(x) —— 将元素x写入到队列的尾部 pop() —— 从队列首部移除元素 peek() —— 返回队列首部元素 empty() —— 返回队列是否为空注意:你...
  • NoMasp
  • NoMasp
  • 2016-01-20 21:18
  • 2318
内容举报
返回顶部
收藏助手
不良信息举报
您举报文章:深度学习:神经网络中的前向传播和反向传播算法推导
举报原因:
原因补充:

(最多只允许输入30个字)