九章动态规划

一、背包问题

题目

https://leetcode-cn.com/problems/coin-change/

题目

https://leetcode-cn.com/problems/coin-change-2/submissions/

题解

https://leetcode-cn.com/problems/coin-change-2/solution/dong-tai-gui-hua-wan-quan-bei-bao-wen-ti-by-liweiw/

题目

https://www.lintcode.com/problem/backpack/description

题目

https://www.lintcode.com/problem/backpack-v/description

题目

https://leetcode-cn.com/problems/combination-sum-iv/

题目

https://www.lintcode.com/problem/backpack-ii/description

题目

https://www.lintcode.com/problem/backpack-iii/

二、坐标型动态规划

题目

https://leetcode-cn.com/problems/unique-paths/

题目

https://leetcode-cn.com/problems/unique-paths-ii/

题目

https://leetcode-cn.com/problems/jump-game

题目

https://www.lintcode.com/problem/paint-house/description

题目

https://leetcode-cn.com/problems/decode-ways/

题目

https://leetcode-cn.com/problems/longest-continuous-increasing-subsequence/

题目

https://leetcode-cn.com/problems/minimum-path-sum/

题目

https://www.lintcode.com/problem/bomb-enemy/description

题目

https://leetcode-cn.com/problems/counting-bits/

 三、序列型动态规划