Dynamic Programming

Posted 2020-10-02 Ariel_HKUST

tags:

篇首语：本文由小常识网(cha138.com)小编为大家整理，主要介绍了Dynamic Programming相关的知识，希望对你有一定的参考价值。

First, think of solution as a linear sequence of decisions.

Second, work backward from the last decision to see: how a decision depends on previous decisions.

Third, introduce some notation to express the recursive relation,

Fourth, generate condition, find out boundary condition, find out how to do iteration

Typical problem: knapsack, longest common subsequence...

以上是关于Dynamic Programming的主要内容，如果未能解决你的问题，请参考以下文章