Dynamic programming (1)-concept

Dynamic programming

• Dynamic programming is a process of turning big things into small and small things ;

1. Features:

• Decompose the original problem into several sub-problems;
• All sub-problems only need to be solved once;
• Store solutions to sub-problems;

2. Dynamic programming problems are generally analyzed from four perspectives

• 1. State definition; (There must be a corresponding relationship between states)
• 2. Definition of transition equation between states;
• 3. Initialization of the state;
• 4. Return the result;

3. Adapt to the scene

• Maximum value/minimum value, is it feasible, is it right, the number of solutions, etc.;