Dynamic Programming 动态规划

:material-circle-edit-outline: 约 69 个字

Dynamic progragmming refer to simplifying a complicated problem by breaking it down into simpler sub-problems in a recursive manner. If a problem can be solveed optimally by breaking it into sub-problems and then recursively finding the optimal solutions to the sub-problems, then it said to have an optimal substructure.