Leetcode232. Implement Queue using Stacks[栈实现队列]

最新推荐文章于 2024-10-30 00:15:00 发布

Sora_neu

最新推荐文章于 2024-10-30 00:15:00 发布

阅读量375

点赞数

CC 4.0 BY-SA版权

分类专栏： ————『编程训练记录』文章标签：栈队列 Leetcode

本文链接：https://blog.youkuaiyun.com/mengzhengyu1025/article/details/51057644

————『编程训练记录』专栏收录该内容

4 篇文章

订阅专栏

本文详细介绍了如何利用栈的数据结构来实现队列的基本操作，包括入队、出队、获取队首元素和判断队列是否为空。通过实例演示了栈和队列之间的转换过程，旨在提高对数据结构的理解。

摘要生成于 C知道，由 DeepSeek-R1 满血版支持，前往体验 >

一、题目描述

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)

二、考察点

栈和队列

三、CODE描述

栈和队列

import java.util.Stack;
class MyQueue {

    // Push element x to the back of queue.
    Stack<Integer> stack1 =new Stack<Integer>(); // push
    Stack<Integer> stack2 =new Stack<Integer>(); // pop
    public void push(int x) {
    	stack1.push(x);      
    }

    // Removes the element from in front of queue.
    public void pop() {
    	if(stack2.empty()){
    		while(!stack1.empty()){
    			int top = stack1.peek();
    			stack1.pop();
    			stack2.push(top);
    		}
    	}
    	if(!stack2.empty()){  
        	stack2.pop();   
    	}
    }

    // Get the front element.
    public int peek() {
    	if(stack2.empty()){
    		while(!stack1.empty()){
    			int top = stack1.peek();
    			stack1.pop();
    			stack2.push(top);
    		}
    	}
    	if(stack2.empty()) return -1;
        else    	
    	return stack2.peek(); 
    	
    }

    // Return whether the queue is empty.
    public boolean empty() {
        
    	return stack1.empty()&&stack2.empty();
    }
}

四、结果

越努力，越幸运。