Programmer Think

catalogue Question 1: judgment subsequence Question 2: different subsequences Question 3: deletion of two strings Question 4: editing distance Today, we continue to study the algorithm problems of dynamic programming, which are a series of algorithm problems about finding editing distance. Let's make a summary. I'll copy these problems t ...

Title portal Main idea of the title: Given an undirected graph G without self ring and mu lt iple edges, as well as the starting point and end point S and T, the edge weight is 1, find the path length from S to T < = the number of shortest path length + 1. Problem solving ideas Since the edge weight length is constant as 1, the shortest ...

💖 About the author: Hello, I'm brother cheshen, cheshen at No. 18 Fuxue road 🥇 ⚡ About - > Che Shen: the fastest time from the bedroom to the laboratory is 3 minutes, and the slowest time is 3.5 minutes (that half minute is actually waiting for the traffic light) 📝 Personal homepage: Drivers only need cars and hands, and the pressure com ...

"Fool code template" solves three basic problems    Preface: the focus of this article is the establishment and application of fool code template. In the part of knapsack principle, you may talk less and jump. You can focus on absorbing the knowledge of "code template part" and the application method of cod ...

Algorithm is really wonderful. It's easy to be addicted after learning. Of course, it's said on a simple premise. If I encounter that kind of problem, I also have a headache. Today's plot is still the form of dialogue between teachers and students. In this way, I think it is more gradual and less abrupt. What do you think? Now, students, let' ...

subject describe Peking University network laboratory often needs to order takeout for activities, but the maximum amount of reimbursement for each order is C yuan. There are N kinds of dishes to order. After ordering for a long time, the network laboratory has a quantitative evaluation score for each dish i (indicating the palatability of th ...

1. Maze Title Description Recently, little Y is playing a maze game. The game is played on an n * m grid. Each grid may be an open space or an obstacle. At the beginning of the game, the character controlled by the player is located in an open space in the figure. During the game, players can use the up, down, left and right keys to control ...

Sword finger offer brush questions 03 [duplicate number in array] class Solution { public: int findRepeatNumber(vector<int>& nums) { sort(nums.begin(),nums.end()); for(int i=0;i<nums.size();i++) { if(nums[i+1]==nums[i]) { //cout<<nums[i]<<endl; ...

First of all, the official solution of last year is here. You can have a look 19 official explanation of the selection of ruozhuo In my problem solution, I will analyze the code of problem C sentence by sentence as far as I can. Problem C has not been figured out yet Soft Zhuo selects A Taoge to supplement the spirit Soft Zhuo selection A This ...

General catalogue Online evaluation address (ybt) Evaluation address (LOJ) Online evaluation address (LUOGU) Understanding examples is the key. By the middle order traversal, pre order traversal to determine the sample, binary tree form. The sample score is calculated as follows: f(2)=7 f(5)=1*7+5=12 f(5)=10 f(4)=1*10+2=12 f(3)=12*1 ...