java动态规划学习笔记

 学习笔记目录，这里记录个大纲，详情点链接

打家劫舍问题

根据前面的状态动态决定当前的状态

打家劫舍 1 https://blog.csdn.net/m0_73065928/article/details/137058145?spm=1001.2014.3001.5501

解决圆桌循环类的动态规划问题

打家劫舍 2https://blog.csdn.net/m0_73065928/article/details/137058347?spm=1001.2014.3001.5501

树形dp问题

打家劫舍 3https://blog.csdn.net/m0_73065928/article/details/137057772?spm=1001.2014.3001.5501

背包问题

01背包问题综述

01背包问题（二维数组）https://blog.csdn.net/m0_73065928/article/details/136794406?spm=1001.2014.3001.5501

01背包问题（滚动数组）https://blog.csdn.net/m0_73065928/article/details/136826238?spm=1001.2014.3001.5501

01背包问题类型

分割等和子集 (解决能不能装满背包的问题)https://blog.csdn.net/m0_73065928/article/details/136859130?spm=1001.2014.3001.5501

最后一块石头的重量 II（解决背包最多装多少问题）https://blog.csdn.net/m0_73065928/article/details/136859423?spm=1001.2014.3001.5501

目标和（解决装满背包有多少种方法问题）https://blog.csdn.net/m0_73065928/article/details/136889013?spm=1001.2014.3001.5501

一和零（解决01背包的二维背包问题）https://blog.csdn.net/m0_73065928/article/details/136892068?spm=1001.2014.3001.5501

完全背包问题综述

完全背包问题https://blog.csdn.net/m0_73065928/article/details/136892284?spm=1001.2014.3001.5501

完全背包问题类型

零钱兑换 | |（组合数问题）https://blog.csdn.net/m0_73065928/article/details/136919704?spm=1001.2014.3001.5501

组合总和 Ⅳ（排序数问题）https://blog.csdn.net/m0_73065928/article/details/136920337?spm=1001.2014.3001.5501

零钱兑换（解决最少个数/价值最小化问题）https://blog.csdn.net/m0_73065928/article/details/136924753?spm=1001.2014.3001.5501

未完待续.....