本节是学习Leetcode Discuss中关于动态规划规律的总结时所做的记录。原文作者将动态规划分为五类：Minimum(Maximum) Path to Reach a Target, Distinct Ways, Merging Intervals, DP on Strings, Decision Making。除了每个分类都有对应的讲解和例题外，还给出了对应练习题的list，共52题。

Minimum(Maximum) Path to Reach a Target

Minimum(Maximum) Path to Reach a Target

Distinct Ways

Distinct Ways

Merging Intervals

Merging Intervals

DP on Strings

DP on Strings

Decision Making

Decision Making

Reference