Programmer Think

In the process of writing this article, we refer to the content of the course "Introduction to Python Programming and data science" by Mr. Hu Junfeng. Concept: Multiple tasks should be carried out simultaneously at one time, but not necessarily at the same time.Parallel: promote multiple tasks at the same time in a period of time, a ...

1, The blue bridge cup test questions are divided into candy [the fifth session], [provincial competition], [group B] (1) Problem description Time limit: 1.0s memory limit: 256.0MB There are n children sitting in a circle. The teacher gives each child an even number of sweets at random, and then plays the following game: Each child gave ha ...

Heap topK problem - heap sorting The concept of heap ❓ To represent a binary tree with the child's representation (a common representation for brushing questions) is essentially a chain storage. In fact, there is also a sequential storage for the storage of binary trees. To put it bluntly, take an array to store a binary tree, and the way to ...

Because I haven't played the shortest board for a long time, I almost forgot the two algorithms... floyd is too simple, so I remember QAQ No, let's play the board first. You can practice with two questions: Weakened version: [template] single source shortest path (weakened version) - Luogu Enhanced version: [template] single source shortest ...

1 what is LRU cache LRU (Least Recently Used) algorithm is an elimination strategy. In short, the implementation is as follows: put some elements into a container with fixed capacity for access. Due to the limited capacity of the container, the container should ensure that the elements that have been used recently are always in the contain ...

Backtracking, greedy, and dynamic planning ideas are developed by doing a lot of exercises, not in a few days, and the title won't tell you which algorithm to use. Keep working on the problem. Back-tracking - 46. Full arrangement (medium) 51. Queen N (difficult) Pre-order traversal code executes at the point in time before entering a node, an ...

As we all know, the size of cache is limited! When the cache is full, it requires a cache elimination strategy to determine which data should be cleaned out. There are three common strategies: First In, First Out (FIFO), Least Frequently Used (LFU) and Least Recently Used (LRU). Take a look at this LRU design question on LeetCode: 1.Please de ...

ES6 module (introduction, features) introduce ES6 introduces modularity. Its design idea is to determine the dependencies of modules and the variables of input and output at compile time. The modularization of ES6 is divided into two modules: export @ and import. characteristic The module of ES6 automatically turns on the strict mode, ...

1 overview of KMP algorithm Recently, when writing leetcode28, I thought of KMP algorithm. I have seen this algorithm roughly before and searched a lot of information on the Internet, but I still can't understand it. Recently, I read it in detail again and finally found something. So make a record to facilitate your memory. Problem Description ...

catalogue 1. Definition of string 2. Access of contents in string 3. Analysis of common function examples of string In C language, the character array char str [] is generally used to store strings, but sometimes it is troublesome to use string array. String type is added to C + +. Note that if you want to use string, you need to add a ...