dynamic programming

The difference between dynamic programming and divide and conquer

Characteristics of divide and conquer algorithm problem , be quite distinct from each other , Divide and rule .

Dynamic programming , There is a large correlation between different problems . Solving optimization problems

optimization problem , The solution of the problem is expressed by value , To find the largest / minimum value ==> The optimal

There are multiple optimal solutions , Just find the right one