catalogue
1, Queue
ðŸ§Š Concept of queue
ðŸ§Š Terminology of queues
2, Normal queue
ðŸ§Š Queue method
ðŸ§Š Use of methods
ðŸ§Š Simulate the implementation of ordinary queue
3, Circular queue
ðŸ§Š Introduction to circular queue
ðŸ§Š Array subscript loop technique
ðŸ§Š Cyclic queue diagram
ðŸ§Š How to distinguish whether the circular queue is full or e ...

Posted by Amitk on Sat, 09 Apr 2022 19:16:28 +0300

Preorder traversal
What is the preorder traversal of a binary tree? In short, it is "root left and right". In expansion, it is to give priority to accessing the root node of a binary tree, then access its left subtree, and then access its right subtree after all the left subtrees are accessed. For the subtree, follow the previous ac ...

Posted by Nulletz on Sat, 09 Apr 2022 10:08:12 +0300

Basic operation of sequential cyclic queue of data structure (very detailed C language version)
Write in front: because of the beginner's data structure, if readers find any errors or doubts, they can comment on private letters and communicate together. If they think it's well written, please praise it. Thank you!
1. Remove worries and d ...

Posted by mikeyca on Sat, 09 Apr 2022 09:26:08 +0300

The Swagger library provided by SpringFox has been used in the SpringBoot project before. After going up and down the official website, I found that there has been no new version for nearly two years! SpringBoot 2.6 was upgraded a few days ago In version x, it is found that the compatibility of this library is getting worse and worse. Some comm ...

Posted by sam_rich on Fri, 08 Apr 2022 16:19:40 +0300

Basis of parallel search
1, Concept and introduction
Join query set is a tree data structure, which is used to deal with the merging and query of some disjoint sets.
The idea of parallel search set is to use an array to represent the whole forest (parent). The root node of the tree uniquely identifies a set. As long as we find the tree root ...

Posted by Skilo on Fri, 08 Apr 2022 07:45:00 +0300

I Select sort
The logic of selecting sorting is very simple, that is, loop through all the data that has not been sorted, and then take out the largest or smallest data in each round of loop and put it at the end of the sorted sequence. It is very stable because it will not apply for additional space, so the space complexity is O(1). The algo ...

Posted by mike16889 on Fri, 08 Apr 2022 05:12:51 +0300

A. What day
Title Description:
Title Description
January 1, 2000 is the first day of that year. So, May 4, 2000, is the first day of that year?
Output format
Output an integer to represent the answer
Train of thought analysis:
2000 is a leap year (366 days). The way to judge the normal year of leap year is: it can be divided b ...

Posted by thunderdogg on Thu, 07 Apr 2022 18:03:07 +0300

âš¡ â’‹ 1 horse traversal - BFS
Traversal of horses
1.1 problem solving ideas
This question is the standard bfs (breadth first search) template question type. If you know how to do maze problems, this question is not difficult. The difference is that there are 8 positions to choose in the next step.
1.2 code pasting
#include<bits/stdc ...

Posted by dzelenika on Thu, 07 Apr 2022 08:51:07 +0300

1. Basic knowledge
1.1 procedure for storing a piece of data
Storing data is the first step in processing data. Only by storing the data correctly can we carry out effective processing and analysis. Otherwise, it can only be a mess and there is no way to start. So, how can we store all kinds of complicated data related to users' busines ...

Posted by carolin on Thu, 07 Apr 2022 06:39:42 +0300