Table of contents
1. Binary search tree concept
2. Non-recursive implementation of binary search tree
2.3 Search for deletion of binary tree (the most important and most difficult interface)
3.(key) recursive implementation of binary search tree
4.(KV) recursive implementation of binary search tree
1. Binary search tree concept
A sear ...
Posted by rutin on Wed, 19 Oct 2022 15:57:05 +0300
First, the concept of the sequence table
*(1)* The sequence table is a linear structure in which data elements are sequentially stored in a segment of storage units with consecutive physical addresses. Generally, array storage is used. Implement various functions on arrays
*(2)* Here we note that the sequence table has the word sequence b ...
Posted by echoofavalon on Wed, 12 Oct 2022 23:37:50 +0300
windy number
Title:
A positive integer with no leading zeros and two adjacent numbers that differ by at least 2 is called a windy number.
Ask in the interval
[
a
,
b
]
[a,b]
...
Posted by Simsonite on Tue, 11 Oct 2022 12:32:37 +0300
better reading experience
\color{red}{Better reading experience}
better reading experience
A. Mocha is in small classes
Original title link
Topic meaning:
a number that differs from each other
...
Posted by chamade76 on Fri, 07 Oct 2022 21:51:05 +0300
First, the basic concept of operator overloading
Operator overloading is to redefine an existing operator and give it another function to adapt to different data types (operator overloading cannot change the original meaning. It cannot change the meaning of the underlying type)
Operator overloading is just a syntactic convenience, i ...
Posted by rdhatt on Fri, 07 Oct 2022 11:27:09 +0300
cache penetrationCache penetration means that the data requested by the client does not exist in the cache and the database, so the cache will never take effect, and these requests will hit the databaseIf a malicious user uses countless threads to concurrently access non-existent data, these requests will all reach the database, which is likely ...
Posted by bliss322 on Sun, 25 Sep 2022 21:01:59 +0300
Common sorting algorithms
1, Select Sort
Selective sorting is a simple and intuitive sorting algorithm
1. First, find the smallest (large) element in the unsorted sequence and store it at the beginning of the sorted sequence.2. Then continue to find the smallest (largest) element from the remaining unsorted elements, and then put it at the e ...
Posted by Clukey on Sat, 24 Sep 2022 21:46:56 +0300
dp 14 longest ascending subsequence (1)
Topic description
describe
Given an array arr of length n, find the length of its longest strictly ascending subsequence.
The so-called subsequence refers to a new array formed by deleting some numbers (or not deleting) from an array. For example [1,5,3,7,3] array, its subsequences are: [1,3,3], [ ...
Posted by cheese on Fri, 23 Sep 2022 21:58:32 +0300
F. Lost Array
I spent many hours fooling around yesterday, reading the wrong questions and reading the wrong code. Finally, I got out of the mess. I wrote a blog to record the mentality of nearly breaking the computer yesterday
Observe the mysterious code of others and find the following mysterious properties
For ordered column subset XOR, ...
Posted by Sillysoft on Thu, 15 Sep 2022 21:16:40 +0300
Topic B4: Keyword-based text sorting and retrieval system
1. Subject content and requirements
Topic B4:
(1) Subject content "Memorizing words - personalized memorizing words" is a software for reciting English words. Users can import the thesaurus to be recited according to their own needs, and can edit their own thesaurus. There a ...
Posted by john-formby on Sun, 11 Sep 2022 21:29:45 +0300