## java data structure Chapter 9 - hash table

9.1 hash table (hash) - Google questions
Let's take a look at the actual demand. A computer problem of google: In one company, when a new employee comes to report, it is required to add the employee's information (id, gender, age, address...). When entering the employee's id, it is required to check
Find all the information of the empl ...

Posted by **rtconner** on *Mon, 07 Mar 2022 22:49:58 +0100*

## LeetCode selected TOP interview questions 138 Copy linked list with random pointer

Title Description
Given a linked list of length n, each node contains an additional random pointer random, which can point to any node or empty node in the linked list.Construct a deep copy of this linked list. The deep copy should consist of exactly n new nodes, in which the value of each new node is set to the value of its corresponding orig ...

Posted by **rhodesa** on *Thu, 03 Mar 2022 15:06:28 +0100*

## Three questions: understand hash table and hash conflict

What is a hash table?
Hash tables, also known as hash tables, are array based. This indirectly brings an advantage: the time complexity of search is O(1), and of course, its insertion time complexity is also O(1). There is also a disadvantage: the expansion cost is high after the array is created. There is a "mainstream" idea in hash ...

Posted by **ghornet** on *Thu, 17 Feb 2022 20:40:36 +0100*

## Introduction to redis storage data structure in redis

redis is an in memory database based on key value. The so-called kv storage or kv database means that the data in it is stored one-to-one, in which key is the only index. This structure is generally based on hash table, with high efficiency and search complexity of O(1).
However, hashmap is not omnipotent. With the increase of the amount of ...

Posted by **potato** on *Thu, 10 Feb 2022 23:22:19 +0100*

## linux kernel linked list structure

preface
Look at the source code of linux kernel. You can't get around the double linked list structure of linux kernel.
This article will introduce the double linked list structure in the kernel. because The hook of LSM is inserted into the bpf system call Therefore, we need to take a brief look at the hash table structure.
Kernel code r ...

Posted by **sava** on *Wed, 09 Feb 2022 19:29:47 +0100*

## [C++] Hash_map implementation principle and source code [hash table] [hash mapping] [universal data support] [STL]

Hash_map As a nonlinear data structure Before reading, you need to make sure you really understand what a pointer is And without looking at any source code, the linked list data structure is realized through the principle If unsure, the following articles are recommended: Principle of [C/C + +] pointer and its application and understanding (inc ...

Posted by **driver** on *Wed, 09 Feb 2022 01:52:19 +0100*

## Algorithm learning (disciple plan) 3-2 hash table, bloom filter and classic problem learning notes

preface
(7.3, 3 lessons short, do your best!)
This article is the learning notes for the eighth lecture of the algorithm class.
3-2 section 2 of Chapter V: hash table and bloom filter
(as usual, the shortest learning time is still challenged this time, and it is expected to be less than 3 times the time)
(the difficulty of this course ...

Posted by **Alex C** on *Wed, 26 Jan 2022 03:39:38 +0100*

## [C + +] [hash table] [hash function] implement its own hash table to solve hash conflicts; Dynamic Hash table;

preface
1. Introduction of hash table and hash function
Just like this problem, with a 26 int array, you can hash map each character.
The hash function is: f(char) = char -'a '; The hash table is the int [26];
This simple hash function handles the conversion from key to index, and it is also a simple one-to-one correspondence.
The m ...

Posted by **homer.favenir** on *Tue, 25 Jan 2022 21:20:43 +0100*

## Hash table and record of line points -- Calculation of the maximum number of points on the line

subject
oj platform
Topic analysis
There are two ways to solve this problem, but without exception, hash tables are needed.
The first solution is to record the slope and intercept of the line. Specific steps:
Write a function for calculating the slope and intercept between any two points, and the return value is a binary.Enumerate t ...

Posted by **hame22** on *Mon, 24 Jan 2022 18:07:23 +0100*

## Data structure, hash table (note)

1. Hash table
Why is there a hash table?
For example, chestnuts:
There are thousands of employees in a company. How do I find an employee's information
Through the array, each employee corresponds to a job number. I can directly find the job number to obtain the corresponding information
But I don't want to get it through the job num ...

Posted by **dean7** on *Tue, 11 Jan 2022 02:30:49 +0100*