• ## Go brush 1.0 every Monday

Time：2021-9-25

Series articles： Channel practical application, this is enough! Go brush 1.0 every Monday The picture was taken on January 2, 2021, Zhoushan Dongji island. As I said, I will brush the questions according to the labels. Brush four to five questions for each category and divide it into two articles, the first basic question and […]

• ## How to calculate the median of a set of data in MySQL?

Time：2021-9-18

To get the median of a set of data (for example, the median revenue of a region or a company), we generally divide this task into three sub tasks: Sort the data and give each row of data its ranking in all data; Find the median ranking number; Find out the value corresponding to the […]

• ## One SQL question per day

Time：2021-8-13

Do you want to brush the questions together? catalogue 20210610 20210609 20210607 20210604 20210603 20210602 20210601 20210531 20210610 Title: Find the ID and name whose ratio of each group’s accumulation / total number of each group in name is greater than 0.6. Expected results: Create table statement: CREATE TABLE T0610 ( ID INT, NAME VARCHAR […]

• ## Medium of two sorted arrays

Time：2021-5-30

Title: There are two sorted arrays nums1 and nums2 of size m and n respectively. Find the median of the two sorted arrays. The overall run time complexity should be O(log (m+n)). You may assume nums1 and nums2 cannot be both empty. Example 1: nums1 = [1, 3] nums2 =  The median is 2.0 […]

• ## Greedy algorithm – the circular average card problem

Time：2021-5-1

Thinking of solving problems First, suppose that each person passes C [i] to the left (where C  represents the value passed by the first person to the last person), then the sum of the absolute values of C [i] is the minimum number of passes.Suppose that the initial value of each person is a […]

• ## On the application of threshold principle of statistical normal distribution in data analysis

Time：2021-2-3

1、 Background 0.0 God said that there should be a normal distribution, so there is a normal distribution. 0.1 God see normal distribution is good, let random error with the normal distribution. The wonder of normal distribution is that many seemingly random events obey the distribution that can be expressed by an expression, just like […]

• ## Sparkml predicts PV

Time：2020-12-19

background The company needs to forecast the daily traffic for a period of time in the future according to the daily traffic data of the website in the past period, so that the relevant operation and operation and maintenance can be alerted in advance before the peak traffic. This is a typical “time series prediction […]

• ## Leetcode-4. Find the median of two positive arrays

Time：2020-12-3

Find the median of two positive arrays. Given two positive (from small to large) arrays of M and N, nums1 and nums2 are given. Let’s find out the time order of the algorithm. You can assume that nums1 and nums2 are not empty at the same time. Example 1: nums1 = [1, 3] nums2 = […]

• ## The use of vuex mapstate, mapgetters, mapactions, mapmutations, from introduction to mastery

Time：2020-11-26

The storage management mode of Vue has puzzled me for a long time. I haven’t made up my mind to study hard. I have been storing information in Vue project group localStorage.setItem (key, value); // store information localStorage.getItem (key); // get information When you want to store information as an object, you must first convert […]

• ## Bfprt linear search algorithm – (TOPK problem)

Time：2020-11-11

Bfprt linear search algorithmBaidu Encyclopedia: bfprt Bfprt process: Call selectpivot to get the partition axis Call partition to divide the interval according to the partition axis (less than the partition axis area, equal to the partition axis area, and larger than the partition axis area), According to the area where k is located In the […]

• ## PTA_ Data structure learning and experimental guidance_ Explanation_ 1-3.1 median of two ordered sequences

Time：2020-9-28

Advanced experiment 1-3.1 median of two ordered sequences Given that there are two equal length non descending sequence S1, S2, design function to find the median of the union of S1 and S2. The median of the ordered sequence a 0, a 1,…, a n − 1 refers to the value of a (n − […]

• ## Data structure and algorithm (implemented by golang) (8.2) basic knowledge – divide and conquer and recursion

Time：2020-6-24

Divide and conquer and recursion In computer science, divide and conquer is a very important algorithm. The literal explanation isdivide and ruleIt is to divide a complex problem into two or more identical or similar sub problems. Until the last subproblem can be solved directly, the solution of the original problem is the combination of […]