??????????java.lang???泣?????Щ???????????????????????￡???Щ?????????????????????????????????????Щ????????????????????ū?????????????Щ???????????????????????????????????????????????????????????????????????????????????????????????????????
????????????????????????????????????????
????Queue
????add??offer?????????????add???????offer????false??
????remove??poll??????????????????????????????????????
????element??peek???????????????????????????????????????????
????boolean add(E e);
????boolean offer(E e);
????E remove();
????E poll();
????E element();
????E peek();
????PriorityQueue?????????????Object[]queue???????
????Deque???????У?double-ended queue??????Queue???????????????????????????
????void addFirst(E e);
????void addLast(E e);
????boolean offerFirst(E e);
????boolean offerLast(E e);
????E removeFirst();
????E removeLast();
????E pollFirst();
????E pollLast();
????E getFirst();
????E getLast();
????E peekFirst();
????E peekLast();
????boolean removeFirstOccurrence(Object o);
????boolean removeLastOccurrence(Object o);
????ArrayDequeue?????????????????????????????
????List
????boolean add(E e);
????boolean remove(Object o);
????E get(int index);
????E set(int index??E element);
????void add(int index??E element);
????E remove(int index);
????ArrayList???????????(oldCapacity*3)/2+1??
????LinkedList?????????????List????????????Deque????
????Vector???????List????????????????飬?????????????????(capacityIncrement>0)?(oldCapacity+capacityIncrement):(oldCapacity*2)??
????Stack??Vector?????????????Щ????????
????E push(E item)
????E pop()
????E peek()
????boolean empty()
????Map
????boolean containsKey(Object key);
????boolean containsValue(Object value);
????V get(Object key);
????V put(K key??V value);
????V remove(Object key);
????Set<K>keySet();
????Collection<V>values();
????Set<Map.Entry<K??V>>entrySet();
????SotedMap????key???????map??
????SortedMap<K??V>subMap(K paramK1??K paramK2);
????SortedMap<K??V>headMap(K paramK);
????SortedMap<K??V>tailMap(K paramK);
????K firstKey();
????K lastKey();