Stack: a special linear table that allows insertion and deletion of elements only at a fixed end. One end for data insertion and deletion is called the top of the stack, and the other end is called the bottom of the stack. The data elements in the stack follow the principle of Last In First Out LIFO (Last In First Out ...
Posted by Mohammad on Sun, 05 Dec 2021 11:30:29 -0800
Chapter 2 sparse arrays and queues
2.1 sparse array
2.1.1 basic introduction
When most elements in an array are 0 or the same value array, sparse array can be used to save the array (compress redundant data)
Representation of sparse array:
How many rows and columns are there in the first row? How many different values are there (relati ...
Posted by Mortier on Sat, 04 Dec 2021 19:52:55 -0800
In performance test, sometimes an API request can only be processed once for the same data (such as user registration), or can only be executed sequentially. Multiple users are not allowed to operate on the data at the same time. Different data can be requested concurrently. Therefore, data sampling needs to be handled to avoid mult ...
Posted by spode on Sat, 04 Dec 2021 16:13:05 -0800
catalog:What is a queue?What are the characteristics of queues?Queue noun descriptionDetailed explanation of queue typesQueue operationText:What is a queue?Queue is a special linear table, which is only allowed at the front of the table( front)Delete, but at the back end of the table( rear)Like the stack, a queue is a linear table with restrict ...
Posted by plaggypig on Mon, 29 Nov 2021 19:47:13 -0800
Queue is a linear table with limited operation. Its feature is first in first out. (FIFO: First In First Out)
Deletion is only allowed at the front of the table.Insert operations are only allowed at the back end (rear) of the table.
Scenes similar to queue stru ...
Posted by unknown on Sun, 28 Nov 2021 23:13:14 -0800
Java in those let you love the manual tool library, refining the amount of code
1, New features of JDK1.8 Stream
1. Common generation methods of Stream
① Collections in the Collection system can generate streams using the default method stream()
//list to stream
List<String> list = new ArrayList<>();
Posted by phppssh on Mon, 22 Nov 2021 10:08:01 -0800
It's not easy to create, my guest, pay attention, collect and subscribe to one button three times ❤😜
Program = data structure + algorithm. Algorithm is a mixture of mathematical theory and engineering implementation. It is a very interesting and magical knowled ...
Posted by kutte on Sun, 21 Nov 2021 03:31:12 -0800
Previous: https://blog.csdn.net/ylc0919/article/details/111050124 It's been ten months since I said I would send the second generation framework. It's hard to have time to summarize the harvest during this period. After writing the first generation AT queue, I have many ideas. For example, can one AT queue manage multiple AT mod ...
Posted by webtailor on Fri, 19 Nov 2021 12:14:48 -0800
Characteristics of priority queues
Note when using priority queues:
Construction of priority queue
Operation implementation of priority queue
First, a queue is a first in, first out
Data structure of
, but in some cases,
The data of the operation may ...
Posted by Lambneck on Thu, 11 Nov 2021 22:10:14 -0800
Storage mode of sequential queue
Characteristics of sequential queue storage
Definition of empty and full teams
Methods to solve false overflow
Sequential queue function
Code implementation of acyclic sequential queue
Cyclic sequential queue
Judgment method of solving queue full by cyclic sequential queue
Cyclic sequential qu ...
Posted by BryonS on Fri, 29 Oct 2021 23:52:17 -0700