Daily summary of KMeans cluster analysis of "Python data operation"

Content introduction This paper introduces cluster analysis with a simple example of Python using Keans for cluster analysis. Cluster analysis or clustering is the task of grouping a group of objects, Make objects in the same group (called clusters) more similar (in a sense) to objects in other groups (clusters) It is the main task of exp ...

Added by DJ Unique on Tue, 21 Dec 2021 04:37:06 +0200

Written examination record of Netease big data development on August 21, 2021

1. The number of combinations in which the sum of two elements in the array is less than or equal to M For an integer array, how many combinations are there when any two elements are added and less than or equal to M; If yes, output the combined logarithm; No, output 0. code: nums = list(map(int, input().split())) M = int(input()) n = len(nu ...

Added by skatermike21988 on Tue, 21 Dec 2021 04:26:25 +0200

React learning notes -- Virtual Dom and DOM Diffing algorithm

In depth analysis of React Diff principle Before understanding Diff, let's take a look at the structure of React's virtual DOM This is the html structure This is the js code when React renders html. You can try it on babel It can be seen that this is a tree structure React will create a tree (pre for short) when calling the render meth ...

Added by jdimino on Mon, 20 Dec 2021 21:24:19 +0200

Play algorithm | array

Basics Array is a data structure composed of a collection of elements of the same type, which allocates a continuous piece of memory for storage. An array uses an index to access its elements. If we have n values, the array index ranges from 0 to n-1. For any I between 0 and n-1, we can use arr[i] in Java code to access the value of the ith el ...

Added by jesushax on Mon, 20 Dec 2021 18:39:37 +0200

Algorithm learning Leetcode -- sum of three numbers

preface Give you an array num containing n integers. Judge whether there are three elements a, b and c in num, so that a + b + c = 0? Please find all triples with sum 0 and no repetition. Note: the answer cannot contain repeated ternary 1, Violent solution Seeing that the problem is summed according to conditions, the first thing ...

Added by Buchead on Mon, 20 Dec 2021 15:12:14 +0200

iOS LeetCode ☞ rebuild queue based on height

Suppose a group of people with disordered order stand in a queue, and the array people represents the attributes of some people in the queue (not necessarily in order). Each people[i] = [hi, ki] indicates that the height of the ith person is hi, and there is ki people whose height is greater than or equal to hi in front. Please reconstruct and ...

Added by Darghon on Mon, 20 Dec 2021 13:35:32 +0200

Implementation of common image enhancement algorithms -- histogram equalization

1. Preface For the image with low original contrast, we can improve the contrast to enhance the recognition of the image, improve the visual effect of the image, convert it into a form more suitable for human and machine processing, remove useless information and improve the use value. Typical algorithms such as CT image enhancement, fog and ...

Added by Tracekill on Mon, 20 Dec 2021 09:07:15 +0200

Atcoder beginer contest 215 problem solution (A-F)

AtCoder Beginner Contest 215 Problem solving (A-F) A. Your First Judge Main idea of the title: Determine whether the string is equal to " H e l l o , ...

Added by sycoj0ker on Mon, 20 Dec 2021 07:11:42 +0200

Force buckle 68 Align text left and right

subject Given an array of words and a length maxWidth, rearrange the words into text with exactly maxWidth characters per line and aligned left and right ends. You should use "greedy algorithm" to place a given word; That is, put as many words in each line as possible. If necessary, it can be filled with space '' so that each line ha ...

Added by melsi on Mon, 20 Dec 2021 05:24:05 +0200

[solution] 51nod 1316 palindrome matrix

Title portal Title Description One N × M N\times M N × Matrix of M A A A completely by 0 ...

Added by freaka on Mon, 20 Dec 2021 04:55:39 +0200