Tag：linked list
-
[C + + memory management] 8_ G2. 9 overview of STD:: alloc operation mode
summary free_ The list array contains a total of [0 – 15] 16 elements, each of which corresponds to a childsingleLinked list (embedded pointers organization management) Each sub linked list manages multiple memory blocks (the size of memory blocks ranges from 8 bytes to 128 bytes). For example, free_ List [0] manages the 8-byte linked […]
-
[introduction to C / C + + programming] the same data type, linked list comparison array? Which one is more fragrant?
Speaking of linked list, the first reaction: linked list is a data type! It can be used to store multiple batch data of the same type. With this understanding, it is easy to associate array. It is also a data type and can also be used to store batch data of the same type. […]
-
[daily algorithm / brush through leetcode] 2 Add two numbers (medium)
Click here to view more content related to algorithmic interview~ Title Description Give you two non empty linked lists to represent two non negative integers. They store each number in reverse order, and each node can store only one number. Please add the two numbers and return a linked list representing sum in the same […]
-
Force deduction leetcode algorithm foundation 21 day question brushing record ①
Force buckle [leetcode]Basic algorithm 21 days brush questionsRecord one Vegetable chicken algorithm swipe questions and punch in!! ⭐ Binary search 34. Find the first and last position of an element in a sorted array Given an integer array nums arranged in ascending order and a target value target. Find the start and end positions of […]
-
[C + + memory management] 9_ G2. 9 detailed explanation of STD:: alloc operation mode
From the following successive steps, we can understand the basic process of alloc. It includes the concepts of combat readiness pool, free linked list, adding up to 20 blocks at a time, adding amount, fragment processing, processing when memory is insufficient, etc start free_ The list array contains 16 elements, and the sub elements manage […]
-
Let’s take a look at the new front-end column “advanced incomplete guide”
background This article is included inAdvanced incomplete Guidespecial column According to the practice of previous series of articles, the first article is generally a background introduction and outline extraction. This series is still the same (there is no way to improve your writing ability here.) First of all, express my writing purpose: Share it with […]
-
[C + + memory management] 10_ G2. 9 analysis of STD:: alloc source code
STD:: alloc is divided into two levels for memory management. The first level is secondary in the next learning, and the main content is concentrated in the second level. In G4 In version 9, the first level has been deleted G2. Primary memory management in 9 Supplementary notes class semple_alloc: the basic unit of memory […]
-
09 / 05 leetcode hot topic Hot 100 — 22, 23, 31
22. bracket generation class Solution { 23. Merge K ascending linked lists Solution 1: merge two linked lists at a time /** * Definition for singly-linked list. * public class ListNode { * int val; * ListNode next; * ListNode(int x) { val = x; } * } */ class Solution { public ListNode mergeKLists(ListNode[] […]
-
[issue 35] recruitment of golang engineers by Huawei
Simple sorting algorithm and project experience in College; Asked a question about IP filtering; I wrote a bubbling algorithm. I was familiar with Linux kernel and asked about congestion related knowledge on my resume; I asked MySQL and redis, worked out a data structure problem, asked golang, and tore the code by hand. Asked about […]
-
Principle of time wheel and its application in frame
1、 Introduction to time wheel 1.1 why use time wheel In normal development, we often deal with scheduled tasks. Here are some examples of timed task processing. 1) Heartbeat detection。 In Dubbo, a heartbeat mechanism is required to maintain the long connection between the consumer and the provider. The default heartbeat interval is 60s. When […]