Stack:(遗留类,不建议使用)
Stack<Integer> stack = new Stack<>();
stack.push(val);
stack.pop();
stack.peek();
stack.size();
stack.isEmpty()
Queue:(队列)
Queue<Integer> queue= new LinkedList<>();
queue.add(val);
queue.offer(val);
queue.remove();
queue.poll();
queue.element();
queue.peek();
queue.size();
queue.isEmpty()
Deque:(模拟栈)
Deque<Integer> deque= new LinkedList<>();
Deque:(双端队列)
***注意:使用双端队列尽量写明First和Last***
Deque<Integer> deque = new LinkedList<>();
deque.addLast(val);
deque.addFirst(val);
deque.removeFirst(val);
deque.removeLast(val);
deque.peekFirst();
deque.peekLast();
deque.size();