catalogue
Functions to be realized
Realization of specific functions
1. Create a new node
2. Initialization of bidirectional linked list
3. Tail insertion of two-way linked list
4. Printing of bidirectional linked list
5. Header deletion of two-way linked list
6. Destruction of two-way linked list
7. Node search of bidirectional link ...

Posted by wolfcry044 on Fri, 13 May 2022 02:09:49 +0300

content
1. Experiment name and nature
2. The purpose of the experiment
3. Experimental content
4. Knowledge preparation
5. Experimental requirements
6. Code
1. Experiment name and nature
Course data structure Experiment name Operations on linked lists experimental hours 2 Experimental nature □ Verification □ Synthesis √ ...

Posted by kodlcan on Fri, 13 May 2022 01:17:59 +0300

Section 7.3 of algorithm notes - Special Topic on data structure (1) - > linked list processing
Problem A: algorithm 2-8 ~ 2-11: basic operation of linked list
Title Description
Linked list is one of the most basic data structures. It is a linear list realized by linked storage structure. Compared with the sequential table, it does not ha ...

Posted by minds_gifts on Thu, 12 May 2022 22:26:46 +0300

Sorting algorithm is a basic algorithm in computer science, and it is widely used at the same time. python functions also have built-in sorting interfaces, such as the sorted function. In actual production, the sorting algorithm we use in different scenarios will be slightly different. The selection of sorting algorithm mainly considers the ...

Posted by jamesp on Wed, 11 May 2022 22:16:52 +0300

(2) Queue
definition
Similar to a stack, a queue is also a special linear table, and the difference from an array is also reflected in operations such as additions and deletions. The insertion operation of the queue can only be performed at the end of the queue, and the deletion operation of the queue can only be performed at the head of the ...

Posted by cobnut on Wed, 11 May 2022 07:58:00 +0300

preface
Questions that need to open vip will be skipped temporarily
Note navigation
Click the link to jump to the navigation link of all brush notes
401. Binary Watch
The top of the binary watch has 4 LEDs representing hours (0-11) and the bottom 6 LEDs representing minutes (0-59).
Each LED represents a 0 or 1, with the lowest bit on ...

Posted by CodeMama on Tue, 10 May 2022 15:53:22 +0300

1. Background
In the development process, it is inevitable to maintain a set of data, and be able to add, delete, modify and check quickly. If the amount of data is large and needs to be persistent, choose the database. However, if the amount of data is relatively small, does not need persistence, and requires high response time, it is most ap ...

Posted by kolanos7 on Tue, 10 May 2022 14:03:36 +0300

Dynamic programming of leetcode brush questions
The following are some questions about dynamic programming brushing questions summarized in July and August.
Substring and Subsequence Problems
First, substrings and subsequences
Substrings need to be continuous, subsequences need not be continuous, and dynamic programming can be used here.
Abcd-- ...

Posted by SundayDriver on Tue, 10 May 2022 07:44:36 +0300

Clue binary tree
This paper refers to the data structure of Dahua
principle
For a binary list with n nodes, each node has a pointer field pointing to the left and right children, so there are 2n pointer fields in total. The binary tree with n nodes has a total of n-1 branches, that is, there are 2n-(n-1)=n+1 empty finger needle fields. ...

Posted by Satria Ox41464b on Sun, 08 May 2022 08:35:18 +0300

catalogue
Title Description
Backtracking solution
Title Description
Title address: https://leetcode-cn.com/problems/generate-parentheses/
Given that n represents the logarithm of the generated parentheses, please write a function so that it can generate all possible and effective parenthesis combinations. For example, given n = 3, the gen ...

Posted by sundawg on Sat, 07 May 2022 22:48:58 +0300