• Welcome to the world's largest Chinese hacker forum

    Welcome to the world's largest Chinese hacker forum, our forum registration is open! You can now register for technical communication with us, this is a free and open to the world of the BBS, we founded the purpose for the study of network security, please don't release business of black/grey, or on the BBS posts, to seek help hacker if violations, we will permanently frozen your IP and account, thank you for your cooperation. Hacker attack and defense cracking or network Security

    business please click here: Creation Security  From CNHACKTEAM

Recommended Posts

1.哈希的概念:任意长度的输入通过哈希映射成固定长度的输出。

没有办法避免哈希冲突。10个抽屉里的9个苹果必须复制。

无法从哈希值推导出原始文本。

Hashapjdk 1.8前数组链表,1.8后数组链表红黑树。

节点结构:keyvaluenext(在链表中使用)hash(不是key的值,而是key hashcode的新值,高16位,低16位,这样可以更好的哈希)

初始长度为16。(列表初始长度为10,1扩展一次。如果是奇数,不一定是1.5倍。)哈希表是一种惰性加载机制,在第一次put时加载。负载系数0.75

搜索listO(n)mapO(1)的时间复杂度

链表长度达到8哈希表数组长度达到64转红黑树。

PUT: 1,表未初始化。由2计算的插槽位置中没有值3。3计算的槽是链表4,槽是红黑树。

(分发的是什么?不同的服务部署在不同的服务器上,比如mysql部署在一台服务器上,web部署在一台服务器上。

或者像微服务一样,拆分成多个服务,每个服务都可以由独立团队开发/选择技术,独立运营和维护)

Link to comment
Share on other sites

Create an account or sign in to comment

You need to be a member in order to leave a comment

Create an account

Sign up for a new account in our community. It's easy!

Register a new account

Sign in

Already have an account? Sign in here.

Sign In Now