Programmer Think

Sword finger Offer 07 Rebuild binary tree Enter the results of preorder traversal and inorder traversal of a binary tree, please build the binary tree and return its root node. It is assumed that the input pre order traversal and middle order traversal results do not contain duplicate numbers. This problem uses the idea of recursion. Use pre ...

Implementation of basic operation of queue Experimental purpose Master the abstract data type of queue, correctly select it in corresponding application problems, master the implementation method of queue (sequential and chained), the implementation algorithms of two storage structures and basic operations, pay attention to the judgment condi ...

Data structure and algorithm - linked list Previous contents 1 - linked list 2-stack 3-queue 4-tree 5-fig 6-greedy algorithm 7-recursion and divide and conquer 8-sort 9 - query 10 - dynamic programming 11-STL Library Basic concepts Linear table: a finite sequence of zero or more elements 1, Storage structure of linear table There ...

"Ctrl AC! Together AC!" catalogue preface: Definition and node of single linked list: Definition of single linked list: Structure of single linked list node: Establishment of single linked list: Insert a new node with data x into the single linked list: Create linked list by tail interpolation: Traversal of single linked list ...

1. Introduction ① JDK1. Before 8, HashMap was composed of array + linked list. Array is the main body of HashMap, and linked list mainly exists to solve Hash conflict. When an element is put into the set, the Hash value of key, namely hash(key), will be calculated, Then perform bitwise sum operation with the size of the array to calculate ...

catalogue Basic software functions: 1. Enter new student's personal information 2. Newly added information 3. Delete all information according to the new student's name 4. Display the new student information that has been entered and added ​ 5. Search for information by student's name 6. Ranking from high to low according to the fre ...

First day of study I use C + +, please forgive me for the mistakes. The original intention of the article is only to urge me to study. If it happens to be able to help you, I will be very happy. preface 1, 141 Circular linked list Title: give you a head node of the linked list to judge whether there are links in the linked list. ...

1. Student Information Title Description Now I want to make up a list of student achievement points. Chain list node content includes student name, student number, grade point The input is a list of the names, numbers, and performance points of a group of students, stored in a chain. Delete a student node whose score is less than the averag ...

P.S is a non professional and unfamiliar with C + + and algorithms. Starting from the introduction, he uses the Leetcode platform and draws on the ideas of many predecessors. The blog is only for recording. Three questions in this issue's punch list: corresponding to < sword finger Offer 06 Print linked list from end to end > < sword f ...

Reverse linked list ​ Title link here Three pointers: Problem solving ideas: First analyze the special case. When the linked list is empty or there is only one node, directly return to head When there are more than one node in the linked list, we first consider whether we can reverse the pointer in turn, so as to reverse the linked list ...