Implement Queue using Stacks

原创 2015年07月07日 21:36:37

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 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).
题目出处: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());
    }
}


版权声明:本文为博主原创文章,未经博主允许不得转载。

相关文章推荐

Implement Queue using Stacks

Implement Queue using Stacks Implement the following operations of a queue using stacks. pus...

Implement Queue using Stacks

Implement the following operations of a queue using stacks. push(x) -- Push element x to the back o...

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

Implement Queue using Stacks

解题思路:采用两个栈,实现队列,一个用于进栈S1,一个用于出栈和取头元素S2。进栈时必须将S2中元素全部加入S1中,出栈时必须将S1中的元素加入S2中,才可以保证先进先出。判断为空时,S1,S2均为空...

232. Implement Queue using Stacks(C语言版本)(Time Limit Exceeded)

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

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

232. Implement Queue using Stacks

1.Question Implement the following operations of a queue using stacks. push(x) -- Push element x...
内容举报
返回顶部
收藏助手
不良信息举报
您举报文章:深度学习:神经网络中的前向传播和反向传播算法推导
举报原因:
原因补充:

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