Programming VIP

📚 Reference book: data structure (C language) - edited by Yan Weimin, Tsinghua University Press. 📖 chart Graph is a more complex data structure than linear table and tree. In the graph structure, the relationship between nodes can be arbitrary, and any two data elements in the graph can be related to each other. The most representative grap ...

I hope to communicate with you and learn from each other through my blog. If you have any mistakes, please correct them in the comment area 1, What is a linked list Sequential tables have defects in space utilization, system consumption and insertion elements. Linked list is the most commonly used dynamic storage method, which overcomes t ...

Yan's dp analysis Learn the algorithm on AcWing, y is always strong! ha-ha When using this method to solve the dp problem, the introduction is clear, that is, thinking about the dp problem from the perspective of set. The following is an example of the 01 knapsack problem When thinking about a DP problem, we can think about the problem f ...

CT image acquisition human body part MASK (removal machine) When making statistics on the mean standard deviation of CT images, we hope to make statistics only for the human body part, so we need to obtain the MASK mask of the human body part from the CT image, and the human body is often connected with the machine tool part, so we also nee ...

1039: repeat subsequence problem Title Description PIPI has two strings a and B. please find out how many times the string a is repeated at least to make B a subsequence of A. We call x a subsequence of Y if and only if several characters can be deleted from Y to get X. For example, for A = "abb" and B="bbaa", A repeats ...

Write in front Xiaobian found it difficult to understand the detailed process of recursion when brushing questions. His head is like a ball of paste, always with big question marks? We didn't understand the detailed logic until we debugged with PyCharm, so a detailed PyCharm running program is attached for debugging and understanding. Tit ...

Question 1: expand the binary tree into a linked list Here is the root node of the binary tree. Please expand it into a single linked list: The expanded single linked list should also use TreeNode, where the right sub pointer points to the next node in the linked list, and the left sub pointer is always null. The expanded single linked list sho ...

Reading guide Fat friends, in order to better help new students adapt to algorithms and interview questions, we recently started a special assault step by step. In the last issue, we completed 21 days of dynamic programming, and now we will make a 14 day summary of various algorithms. What are you waiting for? Come to fat school for a 14 ...

To get straight to the point, this article shares with you a code developed by me, which mainly realizes several small experiments of online simulation operating system. It can be said to be an online simulation platform (project files can be downloaded by myself when they are transmitted to resources, and I can also get private stamps) Projec ...

catalogue 1, Simple bubble sort 1.1 meaning of bubble sorting 1.2 bubble sorting two steps 1.3 complete code 2, qsort function implementation 2.1qsort function analysis 2.2qsort function to sort structure types 2.3 implementation of qsort by user-defined functions Third, callback function 1, Simple bubble sort 1.1 meaning of bubbl ...