Programming VIP

1. Preface Kernel version: linux 4.9.225. Take freescale as an example. (some contents need to be modified and supplemented, which may not be accurate) 2. General In the previous article, the controller driver uses the connection mode of platform bus. In this section, the PHY device driver is based on the connection mode of device, d ...

Original address Array Basic concepts It is a data structure composed of a collection of elements of the same type, which allocates a continuous piece of memory for storageThe storage address corresponding to the element can be calculated by using the index of the element Basic use of c + + array #include <iostream> #include <ve ...

catalogue Knowledge points: Code template summary: Question: reference: Knowledge points: Linked list: a linear structure in which pointers are connected in series. Each node contains a pointer field and a data field. Type: single linked list (each node points to the next node), double linked list (each node refers to the forward node ...

Double pointer Double pointer is an idea or a skill, not a specific algorithm. Specifically, we use two variables to dynamically store two nodes to facilitate some operations. Usually used in linear data structures. Especially for the problems of linked list, it is often necessary to use two or more pointers to memorize the nodes on the linke ...

Algorithm idea: Starting from the first element, compare the values of two adjacent elements in pairs, and put the larger one behind (from small to large) Average time complexity: O(n2) Worst time complexity: O(n2) Optimal time complexity: O(n) Space complexity: 1 Stability: unstable Suitable for scene: few elements Code implementation: Mode 1 ...

Symbol table Symbol table is set and map. In c + +, there are map and set based on red black tree and unordered based on hash function_ map，unordered_set. The symbol table used in this code is my own implementation, according to the implementation method of algorithm 4. Blacklist The blacklist is to filter out what is on the list and ...

Heap of data structure (priority queue) c++ What is a pile? Heap (priority queue) is a "special" queue. The order in which elements are taken out is based on the priority (keyword) size of elements, not the order in which elements enter the queue. The heap can be regarded as a complete binary tree. You can use either a linked list o ...

Hello, bald men. Today, let's continue to talk about classes and objects Key points of this chapter Initialization listFriendsstatic memberInner classUnderstand encapsulation again Let's talk about constructors After studying the first two chapters [classes and objects], let's take a look at the structure Constructor body assignment ...

title: daily practice (31): flip the word ordercategories: [sword finger offer]tags: [practice every day]date: 2022/03/05Daily practice (31): turn the word orderInput an English sentence and flip the order of words in the sentence, but the order of characters in the word remains the same. For simplicity, punctuation is treated like ordinary let ...

1. Dynamic planning The dynamic programming algorithm is similar to the divide and conquer method. Its basic idea is to decompose the problem to be solved into several sub problems. First solve the sub problems, and then get the solution of the original problem from the solutions of these sub problems. Different from the divide and conquer met ...