美团面试题:Hashmap的结构,1.7和1.8有哪些区别,史上最深入的分析
https://blog.csdn.net/qq_36520235/article/details/82417949
HashMap的数据结构为数组,数组中存的是Node, 会根据key的hash值决定元素的存放位置,如果出现hash冲突会形成单链表,当单链表的长度过长时,由于查找的时候是根据Key的hash值进行查找,hash值都相同,只能逐个比较key的值,就退化为线性查找,时间复杂度一下从O(1)变成了O(n), 所以当单链表的长度过长时会将链表转化为红黑树(1.8之后)将时间复杂度提升到了O(logn)。
HashMap 1.7和1.8的区别?
https://blog.csdn.net/qq_36520235/article/details/82417949
(1)put时元素的存放位置的计算方式不同
(2)put插入方式不同,1.7采用头插法,1.8采用尾插法
单链表的头插法与尾插法。
https://blog.csdn.net/qq_41028985/article/details/82859199
头插法:
// node为新节点
node.data = date;
node.next = head.next;
head = node;
(3)链表过长时,转换为红黑树
end.next = node;
end = node;
HashMap get方法
public V get(Object key) {
Node<K,V> e;
return (e = getNode(hash(key), key)) == null ? null : e.value;
}
/**
* Implements Map.get and related methods
*
* @param hash hash for key
* @param key the key
* @return the node, or null if none
*/
final Node<K,V> getNode(int hash, Object key) {
Node<K,V>[] tab; Node<K,V> first, e; int n; K k;
if ((tab = table) != null && (n = tab.length) > 0 &&
(first = tab[(n - 1) & hash]) != null) {
if (first.hash == hash && // always check first node
((k = first.key) == key || (key != null && key.equals(k))))
return first;
if ((e = first.next) != null) {
if (first instanceof TreeNode)
return ((TreeNode<K,V>)first).getTreeNode(hash, key);
do {
if (e.hash == hash &&
((k = e.key) == key || (key != null && key.equals(k))))
return e;
} while ((e = e.next) != null);
}
}
return null;
}
根据key的hash值进行查找,找到之后对比key值是否相等,如果相等就返回,如果不相等,判断是否有下个节点,也就是是否形成链表,在判断是不是树形节点,是的话就按树的方式进行查找,不是直接对比key值,相等就返回,不相等继续遍历链表。如果没有符合的记录就返回null。
HashMap的put方法
public V put(K key, V value) {
return putVal(hash(key), key, value, false, true);
}
/**
* Implements Map.put and related methods
*
* @param hash hash for key
* @param key the key
* @param value the value to put
* @param onlyIfAbsent if true, don't change existing value
* @param evict if false, the table is in creation mode.
* @return previous value, or null if none
*/
final V putVal(int hash, K key, V value, boolean onlyIfAbsent,
boolean evict) {
Node<K,V>[] tab; Node<K,V> p; int n, i;
if ((tab = table) == null || (n = tab.length) == 0)
n = (tab = resize()).length;
if ((p = tab[i = (n - 1) & hash]) == null)
tab[i] = newNode(hash, key, value, null);
else {
Node<K,V> e; K k;
if (p.hash == hash &&
((k = p.key) == key || (key != null && key.equals(k))))
e = p;
else if (p instanceof TreeNode)
e = ((TreeNode<K,V>)p).putTreeVal(this, tab, hash, key, value);
else {
for (int binCount = 0; ; ++binCount) {
if ((e = p.next) == null) {
p.next = newNode(hash, key, value, null);
if (binCount >= TREEIFY_THRESHOLD - 1) // -1 for 1st
treeifyBin(tab, hash);
break;
}
if (e.hash == hash &&
((k = e.key) == key || (key != null && key.equals(k))))
break;
p = e;
}
}
if (e != null) { // existing mapping for key
V oldValue = e.value;
if (!onlyIfAbsent || oldValue == null)
e.value = value;
afterNodeAccess(e);
return oldValue;
}
}
++modCount;
if (++size > threshold)
resize();
afterNodeInsertion(evict);
return null;
}
put时根据key的hash值和表长n-1进行相与,计算出放置的位置,如果是空的直接插入,否则对比key值,不相等判断是否是树形节点,不是就按链表进行放置。
HashMap rehash
转载:HashMap 的rehash图解:https://www.jianshu.com/p/13c650a25ed3
hashMap 默认容量为16,每次扩容为原来的2倍。
然后会重新计算存放的位置 e.hash & (newCap - 1),在根据元素是单链表还是红黑树进行放置。单链表是采用尾插法插入。
if (oldTab != null) {
for (int j = 0; j < oldCap; ++j) {
Node<K,V> e;
if ((e = oldTab[j]) != null) {
oldTab[j] = null;
if (e.next == null) // 单节点
newTab[e.hash & (newCap - 1)] = e;
else if (e instanceof TreeNode) // 树形节点
((TreeNode<K,V>)e).split(this, newTab, j, oldCap);
else { // preserve order 单链表
Node<K,V> loHead = null, loTail = null;
Node<K,V> hiHead = null, hiTail = null;
Node<K,V> next;
do {
next = e.next;
if ((e.hash & oldCap) == 0) {
if (loTail == null)
loHead = e;
else
loTail.next = e;
loTail = e;
}
else {
if (hiTail == null)
hiHead = e;
else
hiTail.next = e;
hiTail = e;
}
} while ((e = next) != null);
if (loTail != null) {
loTail.next = null;
newTab[j] = loHead;
}
if (hiTail != null) {
hiTail.next = null;
newTab[j + oldCap] = hiHead;
}
}
}
}
}