Programmer Think

catalogue Walk into LightGBM What is LightGBM? Disadvantages of XGBoost Optimization of LightGBM Basic principles of LightGBM Histogram algorithm Histogram acceleration LightGBM parallel optimization Practice code Detailed explanation of parameters Code practice Optimal model and parameters (dataset 1000) Model tuning Every word ...

1, Algorithmic mind map 2, Algorithm classification Time complexity and space complexity of the algorithm: 3, Bubble sorting 1. Basic thought Compare the two adjacent numbers in turn, and put the smaller number in the front and the larger number in the back. 2. Dynamic rendering 3. Code implementation //Bubble sorting private ...

1 topic analysis Link: 138. Copy the linked list with random pointer - LeetCode (LeetCode CN. Com) Give you a linked list with a length of n. each node contains an additional random pointer random, which can point to any node or empty node in the linked list. Construct a deep copy of this linked list. The deep copy should consist of exac ...

1, ACWing:900 Integer partition (1) Problem description A positive integer nn can be expressed as the sum of several positive integers, such as: n=n1+n2 +... + nkn=n1+n2 +... + nk, where n1 ≥ n2 ≥... ≥ nk,k ≥ 1n1, n1 ≥ n2 ≥... ≥ nk,k ≥ 1. We call such a representation a partition of positive integer nn. Now, given ...

The idea of binary search is very simple, but there are many traps in the process of code writing. In particular, binary search has many variants, such as: Find the first element equal to the target value, and return None if it does not existFind the last element equal to the target value, and return None if it does not existFind the first ele ...

Background knowledge required for reading this article: first, lose programming knowledge1, Introduction   in life, every time we arrive at the meal point, we will silently recite in our hearts, "what are you going to eat later?", Maybe we don't want to go far after working all day today. At this time, we will decide that th ...

task 01 array - datawhale and Tianchi Example analysis 1. Sum of two numbers class Solution { public: vector<int> twoSum(vector<int>& nums, int target) { int n = nums.size(); for (int i = 0 ; i < n - 1; ++ i) for (int j = i + 1; j < n ;++ j) { if (nums[i] + nu ...

preface The one-dimensional prefix sum is introduced earlier. The two-dimensional prefix sum is the online upgrade of the one-dimensional prefix sum. The one-dimensional prefix sum is reflected in the array, while the two-bit prefix sum is reflected in the matrix. 1, What are two-dimensional prefixes and? Based on the one-dimensional prefi ...

1. Course content For details, please refer to the course "beauty of data structure and algorithm" on "geek time": 09 | queue: application of queue in limited resource pools such as process pool (geekbang.org) 2. After class practice code Array queue package dataStruct; /** * @ClassName ArrayQueue * @Version 1. ...

1, Title Description To define the data structure of the stack, please implement a min function that can get the smallest element of the stack in this type. In this stack, the time complexity of calling min, push and pop is all. O ( 1 ...