第1阶段目标：强化DP

• 周五发题
• 周二前完成
• 周三改错和总结
• 周四开会

题量是15道

1. Backpack DP (5)
   1.1 Subsum
   1.2 01 背包
   1.3 多重背包
   1.4 完全背包
   1.5 二维费用背包
2. Sequence DP (6)
   2.1 Leetcode: Robber I
   2.2 Leetcode: Robber II
   2.3 Longest Non-Decreasing Subsequence
   2.4 Leetcode: Regular Expression Matching
   2.5 Leetcode: Best Time to Buy and Sell Stock I
   2.6 Longest Zig-Zag Subsequence
3. Leetcode: Edit Distance (1)
4. Merge Stones (1)
5. Leetcode: Maximal Square(1)
6. Leetcode: Maximal Rectangle(1)

Ref:

背包问题九讲
LeetCode DP