[算法][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