ZTE Plus Moon Master-Algorithmic Elite Challenge-First Pilot
1. High Jump
Difficulty: A star Title Description:
In the new year, Niu Niu wants to jump higher. Cows themselves can jump high
h
h
HM. At the same time Niu Niu has
n
n
n high jump bou ...
Added by jengle52 on Fri, 18 Feb 2022 21:52:17 +0200
HashSet source code analysis, based on jdk1 8 detailed analysis
Before reading this article, it is recommended to read the blogger's article on HashMap: HashMap source code analysis + interview questions
HashSet source code analysis
1, Basic introduction
The underlying implementation is based on HashMap, so it is not guaranteed to iterate according to the insertion order or other order The time-con ...
Added by finkrattaz on Fri, 18 Feb 2022 21:28:44 +0200
Hand Tear Heap Sorting--Java Code Implementation
1. Introduction to heap sorting
Heap sorting is a sort algorithm designed with heap as the data structure. Heap sorting is an optional sort with the worst, best, and average time complexity of O(nlogn), which is also an unstable sort.
Large Top heap and Small Top heap
A heap is a complete binary tree with the following properties: Each ...
Added by jeff_lawik on Fri, 18 Feb 2022 20:52:34 +0200
Summary of tree, binary tree and search algorithm
Summary of tree, binary tree and search algorithm
preface
So far, we have learned the basic concepts and common algorithms of tree and binary tree, and found that the tree has great use in searching. Here we make some summary and records.
1, Connecting knowledge points in series with mind map
2, Concept elaboration
1. Trees
a. ...
Added by RobertSubnet on Fri, 18 Feb 2022 17:05:02 +0200
[ybt gold medal navigation 2-1-3] [Luogu p4555] longest double palindrome string (two methods)
Longest double palindrome string
Title Link: ybt gold navigation 2-1-3 / luogu P4555
General idea of the topic
Give you a string and ask you to find the longest substring so that it is composed of two palindrome strings.
thinking
First, let's see the palindrome string. Let's run a Manacher first.
Then we'll think about what to do. First, ...
Added by Ward on Fri, 18 Feb 2022 14:17:09 +0200
Data structure: wonderful journey of stack and queue (picture and text show you the charm of stack and queue)
Stack
Definition: a stack is a linear table whose insertion and deletion operations are limited to one end of the table. It is usually called the top of the stack and the bottom of the stack. When there are no elements in the table, it is called empty stack. Example: suppose stack S=(a1, a2, a3,... an), then a1 is called the bottom element ...
Added by micbox on Fri, 18 Feb 2022 13:17:53 +0200
LeetCode data structure and algorithm learning Day02
Title quoted from
https://leetcode-cn.com/
Graphic data structure and algorithm
Daily learning Day02 learning notes
20 numeric values represent strings
Title Description:
Please implement a function to judge whether the string represents a numeric value (including integer and decimal). The values (in order) can be divided into th ...
Added by WebMonkey on Fri, 18 Feb 2022 10:11:50 +0200
LeetCode notes: Weekly Contest 238
LeetCode notes: Weekly Contest 238
0. Post game summary1. Topic 1
1. Problem solving ideas2. Code implementation 2. Topic 2
1. Problem solving ideas2. Code implementation 3. Topic 3
1. Problem solving ideas2. Code implementation3. Algorithm optimization 4. Topic 4
1. Problem solving ideas2. Code implementation
0. Pos ...
Added by peterj on Fri, 18 Feb 2022 08:11:32 +0200
Python data structure and algorithm
data structure
Introduction
A brief history of the future: Dataism
Problem solving: What Why How a feasible method based on the finite point of view
Turing machine calculation model
Algorithm and computational complexity
Computable problem: the difficulty of the algorithm
Non computable problem: boundary or limit
Breaking th ...
Added by Rony on Fri, 18 Feb 2022 03:11:12 +0200
Algorithm design and analysis -- traveling sales problem -- code analysis and explanation
Problem description
A salesperson wants to sell goods in four cities. The distance between cities is known, as shown in the right figure. How should he choose a route starting from city 1, passing through each city and finally returning to city 1, so as to minimize the total travel distance?
Train of thought analysis
Determine the so ...
Added by tomo11 on Fri, 18 Feb 2022 02:30:27 +0200