Programmer Think

DFS The full text is about 4000 words. If you start learning DFS, I believe it will be of great help to you. Your ability is limited. Many terms are not professional enough. Long live your understanding Depth first search of binary tree The concept of binary tree will not be discussed in detail here The array is used to store the binary tre ...

array Storing objects in arrays In the previous section, we have described the creation and reference of arrays. Next, we mainly introduce the array storage objects, find objects, delete objects and common sorting algorithms. Array elements can be of any type (as long as all elements have the same type), and in addition to the basic da ...

preface If violent solutions are used to solve problems, or insert sorting, bubble sorting, etc., and the time complexity is O (n^2), is there a better sorting? Here we will introduce the master formula and merging algorithm in detail, and its time complexity is O(NlogN) Tip: the following is the main content of this article. The follow ...

About tree DP Tree dynamic programming, as the name suggests, is to do dynamic programming on the data structure of the tree. Because the tree is naturally a recursive data structure, the implementation of tree DP is usually memory search. Because there are two types of transfer: push and pull, the transfer of natural tree DP also has two ord ...

Title Description You are given two integer arrays nums1 and nums2 in non decreasing order, and two integers m and n representing the number of elements in nums1 and nums2 respectively. Please merge nums2 into nums1 so that the merged array is also arranged in non decreasing order. Title Example Example 1: Input: nums1 = [1,2,3,0,0,0], ...

Original link: http://tecdat.cn/?p=17526Original source: Tuo end data tribal official accountThis paper presents an algorithm, which can switch between mean regression and trend following strategy according to market volatility. Two models are studied: one uses historical volatility and the other uses Garch (1,1) volatility prediction. The mean ...

First week of Blue Bridge Cup training camp Question 1 running training Problem description Xiao Ming wants to do a running training. At the beginning, Xiao Ming is full of physical strength, and the physical strength value is 10000. If Xiao Ming runs, he will lose 600 physical strength per minute. If Xiao Ming has a rest, he will increase h ...

Background knowledge required for reading this article: linear regression algorithm and yidui programming knowledge1, Introduction   in the previous section, we learned that one method to solve multicollinearity is to regularize the cost function. One regularization algorithm is called Ridge Regression Algorithm. Let's learn another r ...

TCN from "ABA ABA" to "balabalabala" The concept of TCN (why? What problems can be solved)TCN's parents (origin)Introduction to the principle of TCNCode! 1. What is TCN (time domain convolution network, time convolution network) and what can it do Main application directions: Time series prediction, probability predict ...

Recently, a lot of small partners have communicated with me about brushing problems. My advice is to offer and buckle hot100 first. There are still some very important and frequent occurrences in these problems. Today, I share the 10 most frequently occurring arithmetic problems with you, and learn to make money.   0X01 Flip Chain List ...