Programmer Think

Example: consecutive interval number Xiao Ming has been thinking about such a strange and interesting question these days: How many consecutive intervals are there in an arrangement of 1 ∼ N? The definition of the serial interval here is: If all the elements in the interval [L,R] (i.e. the L-th to r-th elements of this arrangement) can ...

Title address: https://www.luogu.com.cn/problem/P1608 Title Description: The staff quality of "RP restaurant" is not general. After calculating the same phone number, they are ready to let HZH and TZY deliver fast food. They draw a map of the city they live in. It is known that on their map, there are ...

Word splitting (medium) dynamic programming ”Whether leetcode "can be composed and decomposed into - whether" l "is stored in the dictionary and subsequent substrings can be composed when the step size is 1, etc; When the step size is 2, "le" is stored in the dictionary and subsequent substrings can be compose ...

Tree chain subdivision Template question As the name suggests, it is to express the shape of the tree with a linear linked list. Then the first thing is to build a tree. ll siz[N],dep[N],son[N],fa[N];//Son is the coordinate of the great son whose ancestor is x void build_tree(int now) { siz[now]=1;//Size of initialization tree for(int i=h ...

preface Let's first analyze the original LIS problem with Yan dp analysis Strange thief Kidd's glider wing Title Transfer door We can start at any point, and there are two directions: left and right. We have to make the most of the buildings we pass Solution idea: let's take a look at the board problem of the longest body sequence whe ...

Hematemesis sorting programmer must read list: https://github.com/silently9527/ProgrammerBooks WeChat official account: beta Java In the first part, we learned depth first search and knew how to find the path in the graph through depth first search; In this article, we continue to learn other application scenarios of depth first search alg ...

JS implementation of various sorting There are many kinds of sorting in data structure algorithms, common and uncommon, including at least ten kinds. According to their characteristics, they can be roughly divided into two types: comparison sort and non comparison sort. Comparison sort: the relative order between elements is determined by com ...

The so-called people gather in groups and things divide in groups. People like to be with people who have the same personality and hobbies. Commonly known as: get along! Pretty boy, I like you very much~ A and B were childhood sweethearts. A met C through B and found that their interests and hobbies were surprisingly consistent. The three g ...

background Download address: https://rrc.cvc.uab.es/?ch=4&com=downloads Note: this data is open source data, but you need to register an account. You can download it simply by registering; Introduction: it is used for text detection task. The data includes 1000 training samples and 500 test samples; Required data display Firstly, the d ...

leetcode-236. Nearest common ancestor of binary tree deque method class Solution { public: deque<TreeNode*> dqp; deque<TreeNode*> dqq; bool findNode(TreeNode* root, deque<TreeNode*>& dq, TreeNode* target) { dq.push_back(root); if(root == target) { return true; } bool ret = false; if(root->left) ...