JAVA
import java.util.Stack;
public class MyQueue {
/**
* Initialize your data structure here.
*/
private Stack<Integer> stack;
public MyQueue() {
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 and returns that element.
*/
public int pop() {
if (!stack.isEmpty()) {
int temp = stack.get(0);
stack.remove(stack.get(0));
return temp;
}
throw new RuntimeException("元素为空,非法操作");
}
/**
* Get the front element.
*/
public int peek() {
if (!stack.isEmpty()) {
int temp = stack.get(0);
return temp;
}
throw new RuntimeException("元素为空,非法操作");
}
/**
* Returns whether the queue is empty.
*/
public boolean empty() {
if (!stack.isEmpty())
return false;
else return true;
}
}
python
class MyQueue:
def __init__(self):
"""
Initialize your data structure here.
"""
self.data = []
def push(self, x: int) -> None:
"""
Push element x to the back of queue.
"""
self.data.append(x)
def pop(self) -> int:
"""
Removes the element from in front of queue and returns that element.
"""
if len(self.data)!=0:
temp = self.data.pop(0)
return temp
def peek(self) -> int:
"""
Get the front element.
"""
if len(self.data) != 0:
return self.data[0]
def empty(self) -> bool:
"""
Returns whether the queue is empty.
"""
if len(self.data)==0:
return True
else:
return False