What is dynamic programming and what is the knapsack problem

What is dynamic programming and what is the knapsack problem

Dynamic programming (DP) is a method used in mathematics, management science, computer science, economics, and bioinformatics to solve a problem by breaking it down into relatively simple sub-problemsapproach to complex problems.

Compared with the greedy strategy, it will calculate the cost of taking 1, 5, and 11 respectively, so as to make a correct decision, thus avoiding "short-sightedness"!

13,000 likes, very detailed explanation:

What is dynamic programming(Dynamic Programming)?What is the meaning of dynamic programming?- Know

The dp dynamic programming problem has an important feature,

1, is: "the future has nothing to do with the past", which is no aftereffects.

2. Optimal substructure;

The core of the DP algorithm is to reduce the solution space as much as possible according to the topic:

The core idea of ​​DP: Minimize the possible solution space as much as possible

Backpack problem:

A typical example of dynamic programming;