1. Queue
offer(E);
poll();
peek();
isEmpty();
2.Deque (代替stack)
offerLast(E) / offerFirst(E)
pollLast() / pollFirst()
peekLast() / peekFirst()
isEmpty()
1. Queue
offer(E);
poll();
peek();
isEmpty();
2.Deque (代替stack)
offerLast(E) / offerFirst(E)
pollLast() / pollFirst()
peekLast() / peekFirst()
isEmpty()