Programmer Think

Title Link Game 276 week 3 https://leetcode-cn.com/problems/solving-questions-with-brainpower/ Topic content Give you a two-dimensional integer array questions with subscript starting from 0, where questions[i] = [pointsi, brainpoweri]. This array represents a series of questions in an exam. You need to solve them in order (that is, startin ...

Problem description Give you a backpack with a weight of W and N items. Each item has two attributes: weight and value. The weight of the ith item is wt[i] and the value is val[i]. Now, what is the maximum value you can pack with this back package? Problem solving ideas 01 knapsack problem is a very classic dynamic programming problem, ...

Overall summary This time, it's still in a hurry. One important reason is to prepare for the final exam. I haven't been in touch with the game for a long time. On the whole, we should be familiar with the process and skills of doing questions as soon as possible. Of course, it is more important to improve our ability. Topic D The descrip ...

Traveling salesman deformation 2 Traveling salesman deformation 2 (Avionics OJ hangs up) Time limit: 3 seconds Space limit: 256M Title Description Sanli akaman Decided to visit n n n cities. It wants to visit all cities. It doesn't mind which city is he ...

General framework General contents: [learning notes] playing with algorithm interview -- Explanation of Leetcode real questions by categories 9, Dynamic programming problem Classical dynamic programming problem: Fibonacci sequence; Mnemonic search: add mnemonic search on the basis of recursion; Solve problems from top to bottom. D ...

Find the maximum and minimum values of the array In the program, we often use an array (list) to store a given linear sequence (such as {1,2,3,4}), so how to find the maximum or minimum value in the array (sequence)? There are many algorithms for finding the maximum or minimum value in an array (sequence). Next, we take the {3,7,2,1} sequence ...

A. Little H's kitten Title Link meaning of the title Take the x-axis and y-axis as the wall, the origin as the corner, and the kitten is in the corner. Give several points to find out whether the kitten can be surrounded in the corner with the fence around the point, and find the shortest total length of the fence thinking 1. A sim ...

Did you write this because 2021.7.10 biweekly match of force buckle The fourth question was written with memorization + deep search, but there have been several examples that can't pass. I saw another question solution when I was troubled Why can't mnemonic search get a positive solution? It dawned on me. I hereby make a record No aftereffe ...

Central town problem Problem solution In essence, it is a very classic long chain dissection dp problem. We can remember d p u , i ...

Given n items and a backpack. The weight of item i is wi > 0, its value is VI > 0, and the capacity of the backpack is c. How to select the items to be loaded into the backpack to maximize the total value of the items loaded into the backpack? (backtracking is required) Steps: Enter the item quantity n;Input the weight wi and value vi o ...