https://blog.youkuaiyun.com/firstofzh-cnhttps://blog.youkuaiyun.com/https://blog.youkuaiyun.com/firstof/article/details/132270430https://blog.youkuaiyun.com/firstof/article/details/132270430firstofTue, 15 Aug 2023 09:43:16 +0800.超时等待---通过调用线程的sleep(),jion()或I/O请求时,线程会进入到阻塞状态,当sleep()状态超时,join()等待线程终止或者超时,或者I/O处理完毕时,线程重新转入就绪状态.在实际使用中,线程是很占用资源的,如果对线程管理不完善的话很容易导致系统出现问题,因此,在大多数并发框架中,都会使用线程池来管理线程.创建一个可重用固定线程数的线程池，以共享的无界队列方式来运行这些线程，线程池中的线程处于一定的量，可以很好的控制线程的并发量。]]>https://blog.youkuaiyun.com/firstof/article/details/132212298https://blog.youkuaiyun.com/firstof/article/details/132212298firstofFri, 11 Aug 2023 15:59:47 +0800链地址法（Chaining）：将哈希冲突的元素存储在链表中。在哈希表的每个槽位上维护一个链表，具有相同哈希值的元素都放入到对应链表的末尾。当发生冲突时，只需要在链表中进行线性搜索即可找到目标元素。2>开放地址法（Open Addressing）：在发生冲突时，通过一定的探测策略在哈希表中寻找下一个可用的空槽位。常见的探测策略包括线性探测、二次探测和双重哈希等。]]>https://blog.youkuaiyun.com/firstof/article/details/132203858https://blog.youkuaiyun.com/firstof/article/details/132203858firstofThu, 10 Aug 2023 16:04:39 +0800https://blog.youkuaiyun.com/firstof/article/details/131157801https://blog.youkuaiyun.com/firstof/article/details/131157801firstofThu, 15 Jun 2023 10:37:29 +0800https://blog.youkuaiyun.com/firstof/article/details/131149748https://blog.youkuaiyun.com/firstof/article/details/131149748firstofSun, 11 Jun 2023 20:49:57 +0800https://blog.youkuaiyun.com/firstof/article/details/131138579https://blog.youkuaiyun.com/firstof/article/details/131138579firstofSat, 10 Jun 2023 21:45:40 +0800https://blog.youkuaiyun.com/firstof/article/details/131103236https://blog.youkuaiyun.com/firstof/article/details/131103236firstofFri, 09 Jun 2023 18:08:42 +0800https://blog.youkuaiyun.com/firstof/article/details/131104093https://blog.youkuaiyun.com/firstof/article/details/131104093firstofThu, 08 Jun 2023 16:42:20 +0800https://blog.youkuaiyun.com/firstof/article/details/130863993https://blog.youkuaiyun.com/firstof/article/details/130863993firstofThu, 25 May 2023 11:49:38 +0800