1. 单调对列(leedcode - 239)
class MonotonicQueue{
public LinkedList<Integer> list = new LinkedList<>();
// 添加元素,将小于num的全部删除
public void add(int num){
while(!list.isEmpty() && list.getLast() < num){
list.removeLast();
}
list.addLast(num);
}
public int max(){
return list.getFirst();
}
// 满足list.getFirst() == num,删除元素
public void poll(int num){
if(list.getFirst() == num){
list.removeFirst();
}
}
}