一、相关概念:
(Deque)双端队列能够在队头、队尾进行添加、删除等操作
二、接口设计:
三、代码实现
public class Deque<E> {
private List<E> list = new LinkedList<>();//引入自己实现的类 public int size() {
return list.size();
} public boolean isEmpty() {
return list.isEmpty();
} public void clear() {
list.clear();
} public void enQueueRear(E element) {
list.add(element);
} public E deQueueFront() {
return list.remove(0);
} public void enQueueFront(E element) {
list.add(0, element);
} public E deQueueRear() {
return list.remove(list.size() - 1);
} public E front() {
return list.get(0);
} public E rear() {
return list.get(list.size() - 1);
}
}