GeeksForGeeks DP

http://www.geeksforgeeks.org/dynamic-programming-set-24-optimal-binary-search-tree/   树的DP状态

http://www.geeksforgeeks.org/ugly-numbers/

http://www.geeksforgeeks.org/maximum-size-sub-matrix-with-all-1s-in-a-binary-matrix/  这个是方阵，比Leetcode上那个题简单点。

 http://www.geeksforgeeks.org/dynamic-programming-set-11-egg-dropping-puzzle/

http://www.geeksforgeeks.org/dynamic-programming-set-16-floyd-warshall-algorithm/

http://www.geeksforgeeks.org/dynamic-programming-set-18-word-wrap/  没见过的题，思路和算法设计手册中书架那个题目很像

http://www.geeksforgeeks.org/dynamic-programming-set-14-variations-of-lis/  LIS变形问题小结，Building Bridge

http://www.geeksforgeeks.org/dynamic-programming-set-21-box-stacking-problem/ 

http://www.geeksforgeeks.org/dynamic-programming-set-23-bellman-ford-algorithm/

http://www.geeksforgeeks.org/largest-independent-set-problem/   递归实现的动态规划，将状态值存在结点中

http://www.geeksforgeeks.org/dynamic-programming-set-27-max-sum-rectangle-in-a-2d-matrix/

http://www.geeksforgeeks.org/dynamic-programming-set-31-optimal-strategy-for-a-game/

https://www.hackerrank.com/challenges/play-game/

这两题可以对比下，从两个角度，理解同一个问题

http://www.geeksforgeeks.org/length-of-the-longest-arithmatic-progression-in-a-sorted-array/