232. Implement Queue using Stacks | 用栈实现队列的功能

本文介绍了一种利用两个栈来实现队列的方法。通过这种方式,可以有效地完成队列的基本操作,如push、pop、peek及判断队列是否为空等。文章提供了一个具体的Java实现示例。

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

Subscribe to see which companies asked this question.

思路:用两个栈实现,一个用于输入stack1,一个用于输出stack2,在从stack1转移到stack2时,要注意,只有当stack2为空时才能转移,不然顺序会乱掉。

public class MyQueue {

		Stack<Integer> stack1;
		Stack<Integer> stack2;

		/** Initialize your data structure here. */
		public MyQueue() {
			stack1 = new Stack<>();
			stack2 = new Stack<>();
		}

		/** Push element x to the back of queue. */
		public void push(int x) {
			stack1.push(x);
		}

		/**
		 * Removes the element from in front of queue and returns that element.
		 */
		public int pop() {
			peek();

			return stack2.pop();
		}

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

		/** Returns whether the queue is empty. */
		public boolean empty() {
			return stack1.isEmpty() && stack2.isEmpty();
		}
	}
/**
 * Your MyQueue object will be instantiated and called as such:
 * MyQueue obj = new MyQueue();
 * obj.push(x);
 * int param_2 = obj.pop();
 * int param_3 = obj.peek();
 * boolean param_4 = obj.empty();
 */


评论
添加红包

请填写红包祝福语或标题

红包个数最小为10个

红包金额最低5元

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

抵扣说明:

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

余额充值