Tag：Orderly
-
Leetcode merges two ordered arrays
order This article mainly records the merging of two ordered arrays of leetcode subject Here are two ordered integer arrays nums1 and nums2. Please merge nums2 into nums1 to make nums1 an ordered array. explain: The number of elements initializing nums1 and nums2 is m and N respectively. You can assume that nums1 has […]
-
Understand LSM tree in one article
Introduction to LSM tree LSM tree (log structure merge tree) is a data structure Literally, it is a tree (data structure) with a certain structure and merge based on log append writing The characteristics are: ① The performance of disk batch sequential write is much higher than that of random write to support random read […]
-
HTTP concurrency / connection establishment / connection migration evolution process
1、 Concurrency● HTTP1.1Method:Establish multiple TCP connections, and one TCP handles one HTTP request.advantage:Each TCP is completely isolated. There is no queue head blocking problem when one TCP processes one request, and the failure of one TCP does not affect the processing of other TCP.Disadvantages:1. The implementation cost is high. TCP is implemented by the operating […]
-
nn.Sequentia
nn.Sequential A sequential container. Modules will be added to it in the order they are passed in the constructor. Alternatively, an ordered dict of modules can also be passed in. As an ordered container, neural network modules will be added to the calculation diagram for execution in the order of incoming constructors. At the same […]
-
Deeply analyze the function principle of let/const in for loop
Quick sort ‘use strict’; const quickSort = function (array, low, high) { if (low >= high) { return; } let i = low; let j = high; const tmp = array[i]; while (i < j) { while (i < j && array[j] >= tmp) { j–; } if (i < j) { array[i++] = array[j]; […]
-
Plicp point cloud iterative nearest neighbor registration method
input parameter Polar coordinate set of point cloud a Point cloud a corresponds to the pose of lidar Polar coordinate set of Point Cloud B Point Cloud B corresponds to the pose of lidar Features Determine the starting position of point finding according to the radian relationship of two point clouds Set the stop conditions […]
-
Merge sort [Java]
Code: 1 public static void mergeSort(int[] arr) { 2 if (arr == null || arr.length < 2) { 3 return; 4 } 5 mergeSort(arr, 0, arr.length – 1); 6 } 7 8 public static void mergeSort(int[] arr, int l, int r) { 9 if (l == r) { 10 return; 11 } 12 int mid […]
-
[take you to redis from the beginning to the beginning] to understand the jump table, this is probably not enough
preface Oh shredded porkOh, Jackyou jump! i jump!Yeah is immersed in the joy of jumpLet’s talk to you todayredisJump table The jump table that everyone needs to know is not only the concept but also the code. It is strongly recommended to read redis5 design and source code analysis edited by Chen Lei Ordered set […]
-
Kubernetes core combat (V) — statefulsets
7、StatefulSets Statefulset is an API object used to manage the workload of stateful applications. Stateful set is used to manage deployment and extend a group of pods, and can provide sequence number and uniqueness guarantee for these pods. Like deployment, stateful set manages a set of pods defined based on the same container. But unlike […]
-
Discover a secret: both Python 3 After 6, the dictionary turned into an ordered set. I verified it again!
I’ve been using version 3.8 for the higher version. I’ll use Python 3.0 first 8 version to test whether it will produce orderly words [read the full text] test_dict = {‘o’: 1,’p’: 2,’q’: 3,’r’: 4,’s’: 5,’t’: 6} Use the KSYS () function to verify that the keys of the dictionary are in order print(test_dict.keys()) # […]
-
[PHP data structure] insert sort: simple insert and sort
Finally, we have entered the learning of our sorting related algorithms. I believe that friends who have learned the algorithm systematically or have not learned the algorithm systematically will have heard of many famous sorting algorithms. Of course, our introduction today is not to start with the most common algorithm, but to introduce it one […]