hash principle, conflict and solution

In the Java programming language, there are two basic structures, one is array and the other is analog pointer (Reference). All data structures can be constructed with these two basic structures, and so can HashMap. When the program tries to put multiple key values into HashMap, take the following code snippet as an example: HashMap<String, ...

Posted by jrmontg on Thu, 14 Oct 2021 05:03:24 +0200

Python learning notes 2021-10-13

What is a container and what is a list In life, a container refers to a container that can hold items. In a program, a container is a data structure that can put multiple elements together. The elements in the container can be obtained iteratively one by one. You can use keywords such as in, not in to judge whether an element is contained ...

Posted by frigidman on Wed, 13 Oct 2021 03:06:25 +0200

8 C++STL set/multiset container details

2.8.1 introduction set/multiset container concept Set and multiset are a collection container, in which the elements contained in set are unique, and the elements in the collection are automatically arranged in a certain order. Set is implemented using the data structure of red black tree variant, which belongs to balanced binary tree. ...

Posted by hiberphoptik on Wed, 13 Oct 2021 02:42:50 +0200

Implement NFA algorithm (based on Python)

reference resources: Python implements DFA deterministic finite automata and NFA non deterministic finite automata_ Blog of remanufacturing P - CSDN blog https://github.com/huiluczP/finiteAutomata/blob/master/NFA.py Ideas for solving problems Design of data structure Referring to the definition of NFA, NFA is a 5-tuple: M = (Q, ∑, &Delt ...

Posted by Unknown User on Tue, 12 Oct 2021 07:04:29 +0200

[data structure] learning of List related knowledge [detailed explanation 2]

List List can be understood as a "linear table", that is, a data structure with sequential relationship; Linear tables can be divided into two types: one is the sequential table ArrayList / vector, and the other is the linked list LinkedList. Basic introduction to Generic Background of the introduction of generics: in order to ...

Posted by vmarellano on Sun, 10 Oct 2021 10:01:38 +0200

In depth C language 2 - Advanced pointer

Welcome back to continue learning C language. After the data storage section, we come to the most important content in C language, pointer. Pointer can be said that in the eyes of beginners of C language or C + +, we are old friends who can't see their heads up. The data structure pointer of C language version is also the protagonist, Therefore ...

Posted by timcclayton on Sun, 10 Oct 2021 07:19:04 +0200

Algorithm [Luogu P2078] friend

Topic background Xiao Ming works in company A and Xiao Hong works in company B. Title Description The employees of the two companies have one characteristic: the employees of one company are of the same sex. Company a has N employees, including P pairs of friends. Company B has M employees, including Q pairs of friends. A friend's friend mu ...

Posted by F.Danials on Sun, 10 Oct 2021 06:56:06 +0200

Binary tree topic summary

1. Iterative traversal of tree Preorder traversal thinking Use stack as storage structure. Each time, first put the root node in, then take out the root node, then put the right child node of the root node in, and then put the left child node. Next time, the root node of the left subtree is taken out, and then the right child node of the ...

Posted by gevo12321 on Fri, 08 Oct 2021 10:11:48 +0200

Introduction to ScanpyAnnData data structure and some API usage

Scanpy introduction and installation Scanpy is an extensible toolkit for analyzing single cell analysis data constructed in conjunction with Ann data (a data structure). For Windows systems, it is best to use the whl file for Scanpy installation. First download the whl file: scanpy-1.7.2-py3-none-any.whl Through conda, use the command cd ...

Posted by jweissig on Fri, 08 Oct 2021 01:18:28 +0200

[java collection series] handwritten HashMap

preface HashMap is a data structure of key value pairs. Given a unique key, get value. The previous two articles said that ArrayList is particularly efficient in random access. LinkedList is efficient for random insertion and deletion. The HashMap in jdk integrates these two advantages. Now jdk11 it's out. But most of our work uses jdk7. I wr ...

Posted by timetomove on Fri, 08 Oct 2021 00:49:53 +0200