Programmer Think

PAT-B1032 - which excavator technology is better Title (20 points) In order to prove which excavator technology is better, PAT organized an excavator skills competition. Now please count the school with the strongest technology according to the competition results. input Enter a positive integer N that does not exceed 10 * * 5 on line 1, th ...

Snowflake algorithm The snowflake algorithm is suitable for generating globally unique numbers, such as database primary key id, order number, etc As for why it is called snowflake algorithm, it is because scientists believe that there are no two identical snowflakes in nature through research. Therefore, this algorithm is named ...

@Binary tree summary Binary tree phased summary From today on, I began to record my daily study and life. I didn't blog much before. Although I learned some Markdown grammar, I'm still not very familiar with it. The topics of Li Kou are recorded through pycharm. Later, in this form, I'll record all kinds of learning, do algorithm problems and ...

Description: the difficulty of this topic is not very high, because the topic has described the ideas almost, but there are some details to pay attention to Title: Solution 1: using char array #include<iostream> #include<string> using namespace std; int main() { string s1, s2, s3, s4; cin >> s1 >> s2 >> s3 ...

Problem description Give you a backpack with a weight of W and N items. Each item has two attributes: weight and value. The weight of the ith item is wt[i] and the value is val[i]. Now, what is the maximum value you can pack with this back package? Problem solving ideas 01 knapsack problem is a very classic dynamic programming problem, ...

Sorting algorithm The complexity of each sorting algorithm is as follows: 1. Bubble Sort Bubble sorting is a simple sorting algorithm.It repeatedly visits the sequence to be sorted, compares two elements at a time, and exchanges them if they are in the wrong order.A total of (arr.length - 1) rounds of sorting are performed, and the number o ...

Tree article Question 1: depth of binary tree Enter a binary tree and find the depth of the tree. The nodes (including root and leaf nodes) passing from root node to leaf node form a path of the tree. The length of the longest path is the depth of the tree, and the depth of the root node is regarded as 1. Data range: the number of nodes ...

This series of notes is for self-study algorithm. It only records the problem solving code and some problem solving ideas. All topics are copyrighted by LeeCode and sword finger offer; We recommend a great series of blog for brushing questions and taking notes, which can be used as a reference for the classification of questions in this series: ...

Zuo Cheng cloud algorithm and data structure course https://www.bilibili.com/video/BV13g41157hK?p=2&spm_id_from=pageDriver subject Given the nodes node1 and node2 of two binary trees, find their lowest common ancestor node. Problem solution Solution I Set a HashMap to save the node and its parent node (set the parent node of the root node ...

Array simple basic algorithm 1. Creation of array and element assignment (if you know, there may be) Yang Hui triangle (two-dimensional array), loop number (binary array), 6 numbers, randomly generated between 1-30 and not repeated 2. For numeric arrays Maximum, minimum, sum, average, etc /*Find the maximum, minimum, average, sum, etc. of ...