DP (dynamic programming)

1. preface

Divide and conquer method ： The problem can be decomposed into homogeneous subproblems with decreasing scale , The subproblems are independent of each other , It does not include announcement sub problems

dp： The problem can be decomposed into homogeneous subproblems with decreasing scale , But many subproblems obtained by decomposition are repetitive . That is, the total big problem can be decomposed into two-level subproblems , Three level subproblem ... Each subproblem in the second level subproblem needs the solution of each third level subproblem , Therefore, each three-level self problem only needs to be calculated once , Save the results , Called when needed .

dp： Every dynamic programming starts with a grid

2. Start

1. introduction —01 knapsack
https://www.cnblogs.com/kkbill/p/12081172.html（ recommend ）
https://blog.csdn.net/qq_38410730/article/details/81667885
2. introduction — Translate numbers into strings
https://leetcode-cn.com/problems/ba-shu-zi-fan-yi-cheng-zi-fu-chuan-lcof/
3. introduction — Longest common subsequence
https://blog.csdn.net/weixin_40673608/article/details/84262695
https://leetcode-cn.com/problems/circus-tower-lcci/submissions/
4. introduction — The longest increasing subsequence
https://blog.csdn.net/qq_50811909/article/details/109308047
https://leetcode-cn.com/problems/circus-tower-lcci/submissions/
5. introduction — The longest substring without repeating characters
https://leetcode-cn.com/problems/zui-chang-bu-han-zhong-fu-zi-fu-de-zi-zi-fu-chuan-lcof/
6. introduction — Matrix multiplication
https://www.cnblogs.com/henuliulei/p/10074465.html
https://max.book118.com/html/2017/0401/98330161.shtm
7. introduction — The minimum number of operations makes the array elements equal
https://leetcode-cn.com/submissions/detail/36441618/
8. introduction — Minimum cost stair climbing problem
https://leetcode-cn.com/problems/min-cost-climbing-stairs/solution/dp-by-codedrt/
9. strengthening — Number of palindrome substrings
https://leetcode-cn.com/problems/palindromic-substrings/
10. strengthening — Split palindrome substring （dp+ to flash back ）
https://leetcode-cn.com/problems/M99OJA/
11. strengthening — Optimal binary search tree
https://blog.csdn.net/ncepuzhuang/article/details/8924369
12. strengthening — The best binary search tree

11. strengthening — Optimal triangulation
https://blog.csdn.net/pi9nc/article/details/9750091
https://www.cnblogs.com/Konjakmoyu/p/4905563.html