Review

Review

Dynamic Programming Basic(High Level)

Step 1:DP定义==》 DP的文字表达式

Step 2:Base Case

Step 3:Induction Rule ==》DP的数学表达式

Step 4:Fill In Order(Topological Sort)填的顺序

Step 5: return what

Step 6: TC&SC

Step6.5:Implementation DP with不优化==》面试里做好这一步一已经可以拿75分

Step 7: optimization优化

Last updated