LeetCode -- Implement Stacks using Queue

Question:

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

Analysis:

问题描述:用队列模仿一个栈。

思路:用两个队列模仿一个栈。每次要pop或者peek时,使用队列倒换一下,剩下最后一个元素单独处理。当且仅当两个队列都为空时,栈才为空。

Answer:

class MyStack {
    Queue<Integer> q1 = new LinkedList<Integer>();
    Queue<Integer> q2 = new LinkedList<Integer>();

    // Push element x onto stack.
    public void push(int x) {
        q1.offer(x);
    }

    // Removes the element on top of the stack.
    public void pop() {
        if(!q1.isEmpty()) {
                while(q1.size() > 1) {
                    int i = q1.poll();
                    q2.offer(i);
                }
                q1.poll();
        } else {
                while(q2.size() > 1) {
                    int i = q2.poll();
                    q1.offer(i);
                }
                q2.poll();
        }
    }

    // Get the top element.
    public int top() {
        if(!q1.isEmpty()) {
            while(q1.size() > 1) {
                int i = q1.poll();
                q2.offer(i);
            }
            int i = q1.poll();
            q2.offer(i);
            return i;
        } else {
            while(q2.size() > 1) {
                int i = q2.poll();
                q1.offer(i);
            }
            int i = q2.poll();
            q1.offer(i);
            return i;
        }
    }

    // Return whether the stack is empty.
    public boolean empty() {
        if(q1.size() == 0 && q2.size() == 0)
                return true;
        return false;
    }
}
时间: 2024-10-13 23:25:47

LeetCode -- Implement Stacks using Queue的相关文章

LeetCode: Implement strStr() [027]

[题目] Implement strStr(). Returns a pointer to the first occurrence of needle in haystack, or null if needle is not part of haystack. [题意] 实现库函数strStr(), 功能是在字符串haystack中找出目标串needle第一次出现的索引位 [思路]字符串的匹配,能够用暴力解法,但不推荐.一般使用KMP算法求解. 简要介绍一下KMP的思想: haystack是

[LeetCode] Implement strStr() [18]

题目 Implement strStr(). Returns a pointer to the first occurrence of needle in haystack, or null if needle is not part of haystack. 原题链接(点我) 解题思路 字符串匹配这也是个老题了,方法主要有下面4种, 1. 暴利破解法(BF),这个没啥说的,就是一轮一轮的比较,知道遇到相匹配的,这个的时间复杂度为O(n^2). 2. KMP,这应该是字符串匹配领域中最长听说的算

[LeetCode] Implement Rand10() Using Rand7()

题目描述 Given a function rand7 which generates a uniform random integer in the range 1 to 7, write a function rand10 which generates a uniform random integer in the range 1 to 10. Do NOT use system's Math.random(). Example 1: Input: 1Output: [7] Example

[LeetCode] 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

leetcode 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

LeetCode Implement Queue using Stacks (数据结构)

题意: 用栈来实现队列. 思路: 一个栈是不够的,至少要两个. (1)插入.永远只插入到stack1中(插到栈顶). (2)弹出.如果stack2不为空,直接弹出stack2的栈顶,否则,将stack1中的所有元素转移到stack2中,栈顶自然就是队头了,再弹出. (3)返回队头.与(2)一样. (4)是否为空.判断两个栈是否同时为空即可. 只要保证stack2为空时才可以将stack1转移到stack2中,就可以保证两边并不会产生混乱而出错. 1 class Queue { 2 /* 3 //

LeetCode -- Implement Queue using Sracks

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

Jan 12 - Implement Queue using Stacks; Stack; Queue Implementation;

代码: class MyQueue { // Push element x to the back of queue. Stack<Integer> stack = new Stack<>(); Stack<Integer> aux = new Stack<>(); public void push(int x) { while(!stack.isEmpty()){ aux.push(stack.pop()); } stack.push(x); while(

leetcode Implement Stack using Queues

Implement the following operations of a stack using queues. push(x) -- Push element x onto stack. pop() -- Removes the element on top of the stack. top() -- Get the top element. empty() -- Return whether the stack is empty. Notes: You must use only s