首页 > 代码库 > 232. 用栈实现队列 Implement Queue using Stacks
232. 用栈实现队列 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.
- You must use only standard operations of a stack -- which means only
push to top
,peek/pop from top
,size
, andis 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).
public class MyQueue {
public Stack<int> stack;
public MyQueue() {
stack = new Stack<int>();
}
public void Push(int x) {
stack.Push(x);
}
public int Pop() {
Stack<int> tempStack = new Stack<int>();
int count = stack.Count();
for (int i = 0; i < count; i++) {
tempStack.Push(stack.Pop());
}
int peek = tempStack.Pop();
stack.Clear();
count = tempStack.Count();
for (int i = 0; i < count; i++) {
stack.Push(tempStack.Pop());
}
return peek;
}
public int Peek() {
int[] arr = stack.ToArray();
return arr[stack.Count - 1];
}
public bool Empty() {
return this.stack.Count == 0;
}
}
null
232. 用栈实现队列 Implement Queue using Stacks
声明:以上内容来自用户投稿及互联网公开渠道收集整理发布,本网站不拥有所有权,未作人工编辑处理,也不承担相关法律责任,若内容有误或涉及侵权可进行投诉: 投诉/举报 工作人员会在5个工作日内联系你,一经查实,本站将立刻删除涉嫌侵权内容。