Programmer Think

"Li Kou" question 1673: find the most competitive subsequence (stack) Give you an integer array num and a positive integer k, and return the most competitive num subsequence with length K. A subsequence of an array is a sequence obtained by deleting some elements from the array (elements may not be deleted). In the first different ...

Sort, also known as Sort Algorithm, is the process of sorting a set of data according to a specified message. Sorted classification: 1) Internal sorting: means that all data that needs to be processed is loaded into internal memory for sorting. Internal sorting includes insert sort (direct insert or Hill sort), select sort (simple sort and heap ...

1, Minimum path coverage definition Minimum path covering means that in a directed acyclic graph, all points in the graph are covered with the least and disjoint simple paths. solution ① Disassemble each point in the original drawing (disassemble point u into U and u+n); ② Set each edge < u, V > in the original graph to the correspond ...

Dictionary tree (prefix tree) summary: The dictionary tree (Trie) is used to determine whether a string exists or has a string prefix. Why do we need a dictionary tree to solve this kind of problem? If we have a dictionary that stores nearly 10000 words, even if we use hash, the actual cost of searching for a word in it is very lar ...

catalogue Basic software functions: 1. Enter new student's personal information 2. Newly added information 3. Delete all information according to the new student's name 4. Display the new student information that has been entered and added ​ 5. Search for information by student's name 6. Ranking from high to low according to the fre ...

lookup The definition of search is the process of finding the element with keyword k in the data structure storing several elements. If the table is modified during the lookup process, it is called a dynamic lookup table, otherwise it is a static lookup table. PI is the probability of finding the ith element in the table, ci is the number of ...

Description of the problem: For sequentially stored linear tables (assuming the sequential table is not empty), use vector s or arrays to insert the sorting algorithm directly and output the sorting results for each trip. Reference function prototype: (vector version) //Insert Sort directly template<class ElemType> void Simple ...

Data structure and algorithm tree Previous contents 1 - linked list 2-stack and queue 3-string 4-tree 5-fig 8-sort 9 - query 6-greedy algorithm 7-recursion and divide and conquer 10 - dynamic programming 11-STL Library Common sorting algorithms Unstable algorithms: quick sort, Hill sort, selective sort, heap sort 1. Bubble sortin ...

1, Definition A string is a finite sequence of characters from the alphabet ΣS = a0a1a2...an-1 ∈ ∑*Features: there are not many types of characters that make up a string, but the string length may be much larger than the character typesterm Equal: if the length is equal and the corresponding characters are the same (S[i] = T[i]), then ...

brief introduction The author graduated from Xi'an Jiaotong University in 2021 and will continue to study postgraduate in this university in September of the same year. After experiencing the intense and exciting job search process of some students around him, the 60w + offer and 30w offer are greatly related to his ability to tear the cod ...