中文说明：动态规划算法的基本思想与分治法类似，也是将待求解的问题分解为若干个子问题（阶段），按顺序求解子阶段，前一子问题的解，为后一子问题的求解提供了有用的信息。在求解任一子问题时，列出各种可能的局部解，通过决策保留那些有可能达到最优的局部解，丢弃其他局部解。依次解决各子问题，最后一个子问题就是初始问题的解
English Description：
The basic idea of dynamic programming algorithm is similar to the divide and conquer method, which decomposes the problem to be solved into several sub problems (stages), and solves the sub problems in order. The solution of the former sub problem provides useful information for the solution of the latter sub problem. When solving any subproblem, all kinds of possible local solutions are listed, and those which are likely to reach the optimal local solutions are retained by decision-making, and other local solutions are discarded. The last subproblem is the solution of the initial problem