最后
看完美团、字节、腾讯这三家的面试问题,是不是感觉问的特别多,可能咱们又得开启面试造火箭、工作拧螺丝的模式去准备下一次的面试了。
开篇有提及我可是足足背下了1000道题目,多少还是有点用的呢,我看了下,上面这些问题大部分都能从我背的题里找到的,所以今天给大家分享一下互联网工程师必备的面试1000题。
注意不论是我说的互联网面试1000题,还是后面提及的算法与数据结构、设计模式以及更多的Java学习笔记等,皆可分享给各位朋友
互联网工程师必备的面试1000题
而且从上面三家来看,算法与数据结构是必备不可少的呀,因此我建议大家可以去刷刷这本左程云大佬著作的《程序员代码面试指南 IT名企算法与数据结构题目最优解》,里面近200道真实出现过的经典代码面试题。
/** The value associated with this ThreadLocal. */
Object value;
Entry(ThreadLocal<?> k, Object v) {
super(k);
value = v;
}
}
2.2.2 构造方法
- 创建一个长度为16的Entry数组,然后存放的位置用hashcode和15做与运算得到,再保存内容。
/**
- ThreadLocalMap is a customized hash map suitable only for
- maintaining thread local values. No operations are exported
- outside of the ThreadLocal class. The class is package private to
- allow declaration of fields in class Thread. To help deal with
- very large and long-lived usages, the hash table entries use
- WeakReferences for keys. However, since reference queues are not
- used, stale entries are guaranteed to be removed only when
- the table starts running out of space.
*/
static class ThreadLocalMap {
/**
- The initial capacity – MUST be a power of two.
*/
private static final int INITIAL_CAPACITY = 16;
/**
- The table, resized as necessary.
- table.length MUST always be a power of two.
*/
private Entry[] table;
/**
- The number of entries in the table.
*/
private int size = 0;
/**
- Construct a new map initially containing (firstKey, firstValue).
- ThreadLocalMaps are constructed lazily, so we only create
- one when we have at least one entry to put in it.
*/
ThreadLocalMap(ThreadLocal<?> firstKey, Object firstValue) {
table = new Entry[INITIAL_CAPACITY];
int i = firstKey.threadLocalHashCode & (INITIAL_CAPACITY - 1);
table[i] = new Entry(firstKey, firstValue);
size = 1;
setThreshold(INITIAL_CAPACITY);
}
.
.
}
2.2.3 set(ThreadLocal<?> key, Object value)
- 如果计算的位置已经有内容了,就覆盖,否则就新建一个Entry存放,再判断是否达到阈值,不够就扩容。
/**
- Set the value associated with key.
- @param key the thread local object
- @param value the value to be set
*/
private void set(ThreadLocal<?> key, Object value) {
// We don’t use a fast path as with get() because it is at
// least as common to use set() to create new entries as
// it is to replace existing ones, in which case, a fast
// path would fail more often than not.
Entry[] tab = table;
int len = tab.length;
int i = key.threadLocalHashCode & (len-1);
for (Entry e = tab[i];
e != null;
e = tab[i = nextIndex(i, len)]) {
ThreadLocal<?> k = e.get();
if (k == key) {
e.value = value;
return;
}
if (k == null) {
replaceStaleEntry(key, value, i);
return;
}
}
tab[i] = new Entry(key, value);
int sz = ++size;
if (!cleanSomeSlots(i, sz) && sz >= threshold)
rehash();
}
2.2.4 setInitialValue()
- 初始化空Entry,因为有的线程ThreadLocal一开始没有存东西,但调用了get方法,这时候没内容,但还是先占个坑,返回null。
/**
- Returns the current thread’s “initial value” for this
- thread-local variable. This method will be invoked the first
- time a thread accesses the variable with the {@link #get}
- method, unless the thread previously invoked the {@link #set}
- method, in which case the {@code initialValue} method will not
- be invoked for the thread. Normally, this method is invoked at
- most once per thread, but it may be invoked again in case of
- subsequent invocations of {@link #remove} followed by {@link #get}.
-
This implementation simply returns {@code null}; if the
- programmer desires thread-local variables to have an initial
- value other than {@code null}, {@code ThreadLocal} must be
- subclassed, and this method overridden. Typically, an
- anonymous inner class will be used.
- @return the initial value for this thread-local
*/
protected T initialValue() {
return null;
}
/**
- Variant of set() to establish initialValue. Used instead
- of set() in case user has overridden the set() method.
- @return the initial value
*/
private T setInitialValue() {
T value = initialValue();
Thread t = Thread.currentThread();
ThreadLocalMap map = getMap(t);
if (map != null)
map.set(this, value);
else
createMap(t, value);
return value;
}
2.2.5 getEntry(ThreadLocal<?> key)
- 利用hashcode找到对应的Entry,如果一次命中找到最好,但扩容过可能不可以一次命中,就要执行 getEntryAfterMiss 方法找。
/**
- Get the entry associated with key. This method
- itself handles only the fast path: a direct hit of existing
- key. It otherwise relays to getEntryAfterMiss. This is
- designed to maximize performance for direct hits, in part
- by making this method readily inlinable.
- @param key the thread local object
- @return the entry associated with key, or null if no such
*/
private Entry getEntry(ThreadLocal<?> key) {
int i = key.threadLocalHashCode & (table.length - 1);
Entry e = table[i];
if (e != null && e.get() == key)
return e;
else
return getEntryAfterMiss(key, i, e);
}
/**
- Version of getEntry method for use when key is not found in
- its direct hash slot.
- @param key the thread local object
- @param i the table index for key’s hash code
- @param e the entry at table[i]
- @return the entry associated with key, or null if no such
*/
private Entry getEntryAfterMiss(ThreadLocal<?> key, int i, Entry e) {
Entry[] tab = table;
int len = tab.length;
while (e != null) {
ThreadLocal<?> k = e.get();
if (k == key)
return e;
if (k == null)
expungeStaleEntry(i);
else
i = nextIndex(i, len);
e = tab[i];
}
return null;
}
2.2.6 整理扩容
- 阈值threshold,为数组容量的2/3。
- 当满足条件if (!cleanSomeSlots(i, sz) && sz >= threshold),就是没有删除过,且容量使用了2/3时,先执行**rehash()**就会整理或者扩容。
- 整理完成,如果满足 if (size >= threshold - threshold / 4) 就会触发扩容,扩容2倍。
/**
- Set the resize threshold to maintain at worst a 2/3 load factor.
*/
private void setThreshold(int len) {
//数组长度的2/3
threshold = len * 2 / 3;
}
/**
- Re-pack and/or re-size the table. First scan the entire
- table removing stale entries. If this doesn’t sufficiently
- shrink the size of the table, double the table size.
*/
private void rehash() {
//整理
expungeStaleEntries();
// Use lower threshold for doubling to avoid hysteresis
if (size >= threshold - threshold / 4)
resize();
}
/**
- Double the capacity of the table.
*/
private void resize() {
Entry[] oldTab = table;
int oldLen = oldTab.length;
//扩容为原来的2倍
int newLen = oldLen * 2;
Entry[] newTab = new Entry[newLen];
int count = 0;
for (int j = 0; j < oldLen; ++j) {
Entry e = oldTab[j];
if (e != null) {
ThreadLocal<?> k = e.get();
if (k == null) {
e.value = null; // Help the GC
} else {
int h = k.threadLocalHashCode & (newLen - 1);
while (newTab[h] != null)
h = nextIndex(h, newLen);
newTab[h] = e;
count++;
}
}
}
总结
阿里伤透我心,疯狂复习刷题,终于喜提offer 哈哈~好啦,不闲扯了
1、JAVA面试核心知识整理(PDF):包含JVM,JAVA集合,JAVA多线程并发,JAVA基础,Spring原理,微服务,Netty与RPC,网络,日志,Zookeeper,Kafka,RabbitMQ,Hbase,MongoDB,Cassandra,设计模式,负载均衡,数据库,一致性哈希,JAVA算法,数据结构,加密算法,分布式缓存,Hadoop,Spark,Storm,YARN,机器学习,云计算共30个章节。
2、Redis学习笔记及学习思维脑图
3、数据面试必备20题+数据库性能优化的21个最佳实践
图
[外链图片转存中…(img-aVDiKtrP-1714905466778)]
3、数据面试必备20题+数据库性能优化的21个最佳实践
[外链图片转存中…(img-Xzbm9Bq8-1714905466779)]