动态规划(dynamic planning)
WIKI
Dynamic programming is both a mathematical optimization method and a computer programming method.In both contexts it refers to simplifying a complicated problem by breaking it down into simpler sub-problems in a recursive manner.
特点
动态规划可以在给定约束条件下找到最优解
在问题可分解为彼此独立且离散的子问题时，就可以使用动态规划来解决
每种动态规划解决方案都涉及网格
单元格中的值通常就是要优化的值
每个单元格都是一个子问题
