zoukankan      html  css  js  c++  java
  • 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).
    Show Company Tags
    Show Tags
    Show Similar Problems
     
    class MyQueue {
        Stack<Integer> stack = new Stack<Integer>();
        // Push element x to the back of queue.
        public void push(int x) {
            stack.add(x);
        }
    
        // Removes the element from in front of queue.
        public void pop() {
            stack.remove(0);
        }
    
        // Get the front element.
        public int peek() {
            return stack.get(0);
        }
    
        // Return whether the queue is empty.
        public boolean empty() {
            return stack.isEmpty();
        }
    }
  • 相关阅读:
    图论概况
    [NOI2006]最大获利
    Dining
    [USACO5.3]校园网Network of Schools 缩点
    I Hate It
    [USACO06JAN]牛的舞会The Cow Prom Tarjan
    爱在心中
    [HAOI2006]受欢迎的牛
    泥泞的道路
    上白泽慧音
  • 原文地址:https://www.cnblogs.com/hygeia/p/5123256.html
Copyright © 2011-2022 走看看