Today’s article was written with my new keyboard. Hey, record it! The following are notes based on the explanation of the Lingcha Mountain Aifu Up Master: In the binary search code, pay attention to the opening and closing of the left and right intervals, which can be divided into closed intervals, left-closed right-open intervals, left-open […]
Tag: bin
Data structure – binary tree (2)
Table of Contents 1. Relevant properties of binary trees: 2. Storage structure of binary tree: (1), sequential storage (array) (2) Derived data structure – heap: 1. The concept of heap 2. Classification of heaps: (3) Implementation of heap (sequential storage) 1. Definition of heap: 2. Heap initialization: 3. Heap destruction 4. Heap printing: 5. Insert […]
The front-end Vue combines with the xlxs library to parse excel files and dynamically assemble table headers!
Directory 1 Introduction 2.Data definition 3. Page layout 4. Upload previous events 5. Parse the excel file and assemble the corresponding relationship between the system header and the excel header 6. Drop-down box change event 1. Preface Recently, there is a demand that users can import a custom excel file at will, so that users […]
Understanding MySQL logs redo, undo, binlog
Understanding MySQL log redo, undo, binlog 1. Problems solved by MySQL log files 2. redo log 2.1. Composition of redo log 2.2. Redo log flushing strategy 2.3. What problems does MySQL’s redo log solve? 3. undo log 3.1. Function of undo log 3.2. Types of undo log 3.3. Life cycle of undo log 3.4. Several […]
BindingFlags in C#: Core enumeration types for reflection
The C# programming language provides a very powerful feature: reflection, which allows us to dynamically obtain and operate type information at runtime. Reflection can be used to implement many advanced functions, such as dynamically loading assemblies, creating object instances, calling methods, accessing fields and properties, etc. To use reflection, we need to use some classes […]
FreeRTOS binary semaphores and counting semaphores
1. Binary semaphore and counting semaphore binary semaphore concept Queue of length 1 There is no need to care about the storage content, just whether it is empty or not. Application scenarios Synchronization of tasks and tasks, tasks and interrupts block When the task obtains the semaphore, if the semaphore is empty, it enters the […]
235. Lowest Common Ancestor of a Binary Search Tree 701. Insert into a BST 450. Delete Node in a BST
235. Lowest Common Ancestor of a Binary Search Tree Given a binary search tree (BST), find the lowest common ancestor (LCA) node of two given nodes in the BST. According to the definition of LCA on Wikipedia: “The lowest common ancestor is defined between two nodes p and q as the lowest node in T […]
Binary tree (chained structure storage)
Personal business card: About the author: A sophomore student who is willing to share what he has learned on the road of study. Personal homepage: GOTXX Personal WeChat: ILXOXVJEThis article is original by GOTXX and first published on CSDN Column series: Learning C language from scratch —– The road to learning data structuresWord of the […]
Basic data structure – binary tree
1. Tree concept and structure Tree is a non-linear data structure, which is a set of hierarchical relationships composed of n (n>=0) limited nodes. It’s called a tree because it looks like an upside-down tree, which means it has the roots pointing up and the leaves pointing down. There is a special node called the […]
C++ binary algorithm: swimming in a swimming pool with rising water level
Involving knowledge points Binary search Union search or BFS. Title In an n x n integer matrix grid, the value of each square grid[i][j] represents the height of the platform at position (i, j). When it starts to rain, at time t, the water level in the pool is t. You can swim from one […]