[算法][LeetCode] Dynamic Programming（DP）动态规划

极值的问题通常考虑用DP

[LeetCode] Coin Change 硬币找零

http://www.cnblogs.com/grandyang/p/5138186.html

[LeetCode] Coin Change 2 硬币找零之二

http://www.cnblogs.com/grandyang/p/7669088.html

[LeetCode] Maximum Subarray（最大子串和问题）

http://blog.nlogn.cn/programming-pearls-the-maximum-sum-of-substring/

http://blog.csdn.net/liyuefeilong/article/details/49591517

http://blog.csdn.net/hhxin635612026/article/details/27373369