Hashmap哈希表
Hashmap是一种著名的数据结构,不过窝还没学数据结构2333
Hashmap定义
Class HashMap<K,V>;
K - the type of keys maintained by this map
好像很多key翻译为键,但我更喜欢钥匙这样的说法。
在Hashmap里每个钥匙<Key>可以对应打开一个<V>
V - the type of mapped values
<V>是Value,==值得注意的是不管是K还是V,都没有给出它的类型
这表示他们可以是任意类型,好玩的话,你可以在一个Hashmap里套一个Hashmap
Hashmap套娃就这样做出来了
Hashmap Methods
return | Method | description |
---|---|---|
void | clear() | Removes all of the mappings from this map. |
Object | clone() | Returns a shallow copy(浅复制) of this HashMap instance: the keys and values themselves are not cloned. |
V | get(Object key) | Returns the value to which the specified key is mapped,or Null if this map contains no mapping for the key. |
Set< k > | keySet() | Returns aSet view of the keys contained in this map. |
V | put(K key,V value) | Associates the specified value with the specified key in this map. |
V | remove(Object key) | Removes the mapping for the specified key from this map if present. |
int | size() | Returns the number of key-value mappings in this map. |
Collection< V > | values() | Returns a Collection view of the values contained in this map. |