Programmer Think

preface The first week mainly describes the basic grammar of C language, and the content is relatively simple; However, there are several challenging homework questions. This paper mainly records the class content and challenging homework of this week for self summary after class. 1, 2021 / 12 / 28 - Day1 Day1 describes various prepa ...

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 ...

catalogue 1. What is the pointer? 2. Pointer and pointer type 2.1 pointer + - integer 2.2 dereference of pointer 3. Field pointer 3.1 cause of formation 3.2 how to avoid wild pointer 4. Pointer operation 4.1 pointer + - integer 4.2 pointer - pointer 4.3 pointer relation operation 5. Pointers and arrays  6. Secondary pointer ...

introduction The data structure course design at the end of this semester requires us to complete a simple small program. I chose a ticket sales system to realize some basic functions; Because the time is short and I make up lessons in the review week, there is nothing outstanding. I'll talk about my code implementation and what can be further ...

116. Populate the next right node pointer for each node Meaning: Given a perfect binary tree, all leaf nodes are in the same layer, and each parent node has two child nodes. Binary tree is defined as follows: struct Node { int val; Node *left; Node *right; Node *next; } Fill in each of its next pointers so that this pointer po ...

Title address: https://leetcode.com/problems/couples-holding-hands/ There is a given length 2 n 2n 2n array A A A. Number by 0 ...

Linked list related summary The chain list problem is very easy to make mistakes. Please be sure to draw the process on the paper first. Please tear it by hand and draw a schematic diagram Virtual head node + iteration + recursion The main types of linked lists are: single linked list, double linked list and circular linked listStorage mode o ...

gpio_chip This chapter explains how to write drivers for these devices step by step, so it includes the following topics: GPIO controller driver structure and data structure Sysfs interface of GPIO controller Representation of GPIO controller in DT Driver architecture and data structure Drivers for such devices shall provide the following: ...

Heap Heap is a special kind of data structure in computer science. Heap can usually be regarded as an array object of a complete binary tree.Heap classification: the heap with the largest root node is called the maximum heap or large top heap, and vice versa is called the minimum heap or small top heap. Common heaps include binary tree heaps, ...

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 ...