232. Implement Queue using Stacks
Posted 阿怪123
tags:
篇首语:本文由小常识网(cha138.com)小编为大家整理,主要介绍了232. Implement Queue using Stacks相关的知识,希望对你有一定的参考价值。
class MyQueue { // Push element x to the back of queue. public void push(int x) { stin.push(x); } // Removes the element from in front of queue. public void pop() { if(stout.isEmpty()) { while(!stin.isEmpty()) { stout.push(stin.pop()); } } stout.pop(); } // Get the front element. public int peek() { if(stout.isEmpty()) { while(!stin.isEmpty()) { stout.push(stin.pop()); } } return stout.peek(); } // Return whether the queue is empty. public boolean empty() { if(stin.isEmpty()&&stout.isEmpty()) return true; else return false; } Stack<Integer> stin=new Stack<Integer>(); //用于入的栈 Stack<Integer> stout=new Stack<Integer>(); //用于出的栈 }
以上是关于232. Implement Queue using Stacks的主要内容,如果未能解决你的问题,请参考以下文章
#Leetcode# 232. Implement Queue using Stacks
LeetCode 232. Implement Queue using Stacks
232.Implement Queue using Stacks
232. Implement Queue using Stacks