Before talked bloggers Mouwang bought a course in data structures and algorithms. Benpian hash table is one of the three sections. Hash table should be a Java programmer and a common data structure first encounter, right? Java's HashMap is the realization of the hash table. It can be said hash table can be considered a basis for comparison, is better understood (need to put aside the careful design of the hash function does not say), relatively easy to use (query time complexity of O (1)) of a data structure. Benpian like to share these three summary notes.
1) hash table opening introduction: https://www.cnblogs.com/christmad/p/11519055.html
2) How to build an industrial grade hash table: https://www.cnblogs.com/christmad/p/11519056.html
3) a hash table is often used together and linked lists: https://www.cnblogs.com/christmad/p/11519059.html
A hash table is a basis for comparison of data structures, we are not the inventor of the hash table, so need some good information when learning a hash table to help us design the dissolution of the list. Implemented in Java code HashMap, only by understanding the hash table design in order to understand why HashMap code implementation is that way fundamentally. HashMap hash table to achieve the operator to achieve a more regular, is learning hash code for this data structure to achieve a rare textbook, there are some tips worth learning, understanding.
This paper any errors, please point out. Please indicate the source.