4 TreeSet/TreeMap
Last updated
Last updated
TreeSet / TreeMap 是底层运用了的数据结构
HashSet / HashMap 存取的时间复杂度为O(1),而 TreeSet / TreeMap 存取的时间复杂度为O(logn)所以在存取上并不占优。
HashSet / HashMap 内元素是无序的，而TreeSet / TreeMap 内部是有序的(可以是按自然顺序排列也可以自定义排序)。
TreeSet / TreeMap 还提供了类似和这两个其他数据结构没有的方法
对于 TreeSet, 实现上述两个方法的方法为：
lowerBound
public E lower(E e) --> 返回set中严格小于给出元素的最大元素，如果没有满足条件的元素则返回null。
public E floor(E e) --> 返回set中不大于给出元素的最大元素，如果没有满足条件的元素则返回null。
upperBound
public E higher(E e) --> 返回set中严格大于给出元素的最小元素，如果没有满足条件的元素则返回null。
public E ceiling(E e) --> 返回set中不小于给出元素的最小元素，如果没有满足条件的元素则返回null。
对于 TreeMap, 实现上述两个方法的方法为：
lowerBound
public Map.Entry<K,V> lowerEntry(K key) --> 返回map中严格小于给出的key值的最大key对应的key-value对，如果没有满足条件的key则返回null。
public K lowerKey(K key) --> 返回map中严格小于给出的key值的最大key，如果没有满足条件的key则返回null。
public Map.Entry<K,V> floorEntry(K key) --> 返回map中不大于给出的key值的最大key对应的key-value对，如果没有满足条件的key则返回null。
public K floorKey(K key) --> 返回map中不大于给出的key值的最大key，如果没有满足条件的key则返回null。
upperBound
public Map.Entry<K,V> higherEntry(K key) --> 返回map中严格大于给出的key值的最小key对应的key-value对，如果没有满足条件的key则返回null。
public K higherKey(K key) --> 返回map中严格大于给出的key值的最小key，如果没有满足条件的key则返回null。
public Map.Entry<K,V> ceilingEntry(K key)--> 返回map中不小于给出的key值的最小key对应的key-value对，如果没有满足条件的key则返回null。
public K ceilingKey(K key) --> 返回map中不小于给出的key值的最小key，如果没有满足条件的key则返回null。
lowerBound 与 upperBound 均为二分查找(因此要求有序)，时间复杂度为O(logn).
PriorityQueue是基于Heap实现的，它可以保证队头元素是优先级最高的元素，但其余元素是不保证有序的。
方法时间复杂度对比：
添加元素 add() / offer()
TreeSet: O(logn)
PriorityQueue: O(logn)
删除元素 poll() / remove()
TreeSet: O(logn)
PriorityQueue: O(n)
查找 contains()
TreeSet: O(logn)
PriorityQueue: O(n)
取最小值 first() / peek()
TreeSet: O(logn)
PriorityQueue: O(1)
比如滑动窗口需要保证有序，那么这时可以用到TreeSet,因为TreeSet是有序的，并且不需要每次移动窗口都重新排序，只需要插入和删除(O(logn))就可以了
This implementation provides guaranteed log(n) time cost for the containsKey,get,putandremoveoperations.
Note that this implementation is not synchronized
ceilingKey/floorKey -> include equal
lower/highrt -> strictly
Modifier and Type
Method and Description
void
boolean
boolean
void
void
boolean
void
int
A Red-Black tree basedimplementation. The map is sorted according to the of its keys, or by a provided at map creation time, depending on which constructor is used.
<,>
(key)Returns a key-value mapping associated with the least key greater than or equal to the given key, ornullif there is no such key.
(key)Returns the least key greater than or equal to the given key, ornullif there is no such key.
()Removes all of the mappings from this map.
()Returns a shallow copy of thisTreeMapinstance.
<? super>
()Returns the comparator used to order the keys in this map, ornullif this map uses theof its keys.
(key)Returnstrueif this map contains a mapping for the specified key.
(value)Returnstrueif this map maps one or more keys to the specified value.
<>
()Returns a reverse orderview of the keys contained in this map.
<,>
()Returns a reverse order view of the mappings contained in this map.
<<,>>
()Returns aview of the mappings contained in this map.
<,>
()Returns a key-value mapping associated with the least key in this map, ornullif the map is empty.
()Returns the first (lowest) key currently in this map.
<,>
(key)Returns a key-value mapping associated with the greatest key less than or equal to the given key, ornullif there is no such key.
(key)Returns the greatest key less than or equal to the given key, ornullif there is no such key.
(<? super,? super> action)Performs the given action for each entry in this map until all entries have been processed or the action throws an exception.
(key)Returns the value to which the specified key is mapped, ornullif this map contains no mapping for the key.
<,>
(toKey)Returns a view of the portion of this map whose keys are strictly less thantoKey.
<,>
(toKey, boolean inclusive)Returns a view of the portion of this map whose keys are less than (or equal to, ifinclusiveis true)toKey.
<,>
(key)Returns a key-value mapping associated with the least key strictly greater than the given key, ornullif there is no such key.
(key)Returns the least key strictly greater than the given key, ornullif there is no such key.
<>
()Returns aview of the keys contained in this map.
<,>
()Returns a key-value mapping associated with the greatest key in this map, ornullif the map is empty.
()Returns the last (highest) key currently in this map.
<,>
(key)Returns a key-value mapping associated with the greatest key strictly less than the given key, ornullif there is no such key.
(key)Returns the greatest key strictly less than the given key, ornullif there is no such key.
<>
()Returns aview of the keys contained in this map.
<,>
()Removes and returns a key-value mapping associated with the least key in this map, ornullif the map is empty.
<,>
()Removes and returns a key-value mapping associated with the greatest key in this map, ornullif the map is empty.
(key,value)Associates the specified value with the specified key in this map.
(<? extends,? extends> map)Copies all of the mappings from the specified map to this map.
(key)Removes the mapping for this key from this TreeMap if present.
(key,value)Replaces the entry for the specified key only if it is currently mapped to some value.
(key,oldValue,newValue)Replaces the entry for the specified key only if currently mapped to the specified value.
(<? super,? super,? extends> function)Replaces each entry's value with the result of invoking the given function on that entry until all entries have been processed or the function throws an exception.
()Returns the number of key-value mappings in this map.
<,>
(fromKey, boolean fromInclusive,toKey, boolean toInclusive)Returns a view of the portion of this map whose keys range fromfromKeytotoKey.
<,>
(fromKey,toKey)Returns a view of the portion of this map whose keys range fromfromKey, inclusive, totoKey, exclusive.
<,>
(fromKey)Returns a view of the portion of this map whose keys are greater than or equal tofromKey.
<,>
(fromKey, boolean inclusive)Returns a view of the portion of this map whose keys are greater than (or equal to, ifinclusiveis true)fromKey.
<>
()Returns aview of the values contained in this map.