Programmer Think

Under a more detailed classification, there are three common types of greedy questions Greed is an idea that constantly selects the local optimal solution to achieve the global optimal solution. In other words, greed is constantly making the most favorable decisions for the present. It is unrealistic to classify all greedy problems in o ...

preface link Niuke Xiaobai monthly race 45 Finish five questions for the first time hh Try to write a solution The codes are directly copy the game time codes, which may be messy I'll try to write notes hh If you have any questions, please point them out hh A This problem is difficult to read... If n > = x Then you can jump horizont ...

answering question have n n n students asked the teacher to answer questions at the same time. Each student has estimated the time of answering questions in advance. The teacher can arrange the order of answering questions, and the students should enter the teach ...

Basic concepts Path: the path from one node to another in a tree is called a path. In the following figure, the path from the root node to node a is a path. Path length: in a path, the path length should be increased by 1 for each node. For example, in a tree, if the number of layers of the root node is specified as 1, the path length from t ...

Catalogue of series articles I Array type problem solving method 1: dichotomy II Array type problem solving method 2: Double finger needle method III Array type problem solving method 3: sliding window IV Array type problem solving method 4: simulation V The basic operation and classic topics of the linked list Vi Classic title of hash tab ...

2022-02-22 swipe questions and punch in every day All in one -- dynamic programming 1268: [example 9.12] complete knapsack problem [Title Description] There are n kinds of articles, each of which has a weight and a value. However, the number of each item is unlimited. At the same time, there is a backpack with a maximum carrying capacity of ...

Chapter 10 greedy algorithm Greed has no fixed template routine If we can find out the local optimum and deduce the global optimum, it is greedy; If the local optimum is not found, it is not greedy, but may be a simple simulation. Greedy algorithm is generally divided into the following four steps: The problem is decomposed into several sub ...

P1926. Little schoolboy - question brushing Army subject Topic background Mathematics is fire, lighting up the lamp of physics; Physics is a lamp, illuminating the way of chemistry; Chemistry is the road leading to the pit of biology; A creature is a pit, burying a man of reason. Classical Chinese is fire, lighting up the palace lamp of hist ...

Address: Force bucklehttps://leetcode-cn.com/problems/score-after-flipping-matrix/ Title: There is A two-dimensional matrix ， A, where the value of each element is ， 0 ， or ， 1. Move refers to selecting any row or column and converting each value in the row or column: change all 0 to 1 and all 1 to 0. After making any number of moves, ...

Change The most direct solution to the change problem is the greedy strategy. For example: for coins with face values of 1, 5, 10 and 25, solve the minimum number of coins required to exchange 63 yuan. The idea of greedy strategy is to constantly use the coins with the largest face value to try. No, in this case, 25 coins are used to try the ...