算法训练营——动态规划问题(第九课)

动态规划问题

 

实际的问题 参考链接

• 递归代码模板
• 分治代码模板
• 动态规划定义
• 不同路径题目
• 不同路径 2 题目
• 最长公共子序列题目
• MIT 动态规划课程最短路径算法
• https://leetcode-cn.com/problems/climbing-stairs/description/
• https://leetcode-cn.com/problems/triangle/description/
• https://leetcode.com/problems/triangle/discuss/38735/Python-easy-to-understand-solutions-(top-down-bottom-up)
• https://leetcode-cn.com/problems/maximum-subarray/
• https://leetcode-cn.com/problems/maximum-product-subarray/description/
• https://leetcode-cn.com/problems/coin-change/description/
• https://leetcode-cn.com/problems/climbing-stairs/description/
• https://leetcode-cn.com/problems/triangle/description/
• https://leetcode.com/problems/triangle/discuss/38735/Python-easy-to-understand-solutions-(top-down-bottom-up)
• https://leetcode-cn.com/problems/maximum-subarray/
• https://leetcode-cn.com/problems/maximum-product-subarray/description/
• https://leetcode-cn.com/problems/coin-change/description/
• https://leetcode-cn.com/problems/house-robber/
• https://leetcode-cn.com/problems/house-robber-ii/description/
• https://leetcode-cn.com/problems/best-time-to-buy-and-sell-stock/#/description
• https://leetcode-cn.com/problems/best-time-to-buy-and-sell-stock-ii/
• https://leetcode-cn.com/problems/best-time-to-buy-and-sell-stock-iii/
• https://leetcode-cn.com/problems/best-time-to-buy-and-sell-stock-with-cooldown/
• https://leetcode-cn.com/problems/best-time-to-buy-and-sell-stock-iv/
• https://leetcode-cn.com/problems/best-time-to-buy-and-sell-stock-with-transaction-fee/
• https://leetcode-cn.com/problems/best-time-to-buy-and-sell-stock/solution/yi-ge-fang-fa-tuan-mie-6-dao-gu-piao-wen-ti-by-l-3/
• https://leetcode-cn.com/problems/perfect-squares/
• https://leetcode-cn.com/problems/edit-distance/ （重点）
• https://leetcode-cn.com/problems/jump-game/
• https://leetcode-cn.com/problems/jump-game-ii/
• https://leetcode-cn.com/problems/unique-paths/
• https://leetcode-cn.com/problems/unique-paths-ii/
• https://leetcode-cn.com/problems/unique-paths-iii/
• https://leetcode-cn.com/problems/coin-change/
• https://leetcode-cn.com/problems/coin-change-2/
• https://leetcode-cn.com/problems/longest-valid-parentheses/
• https://leetcode-cn.com/problems/minimum-path-sum/
• https://leetcode-cn.com/problems/edit-distance/
• https://leetcode-cn.com/problems/decode-ways
• https://leetcode-cn.com/problems/maximal-square/
• https://leetcode-cn.com/problems/max-sum-of-rectangle-no-larger-than-k/
• https://leetcode-cn.com/problems/frog-jump/
• https://leetcode-cn.com/problems/split-array-largest-sum
• https://leetcode-cn.com/problems/student-attendance-record-ii/
• https://leetcode-cn.com/problems/task-scheduler/
• https://leetcode-cn.com/problems/palindromic-substrings/
• https://leetcode-cn.com/problems/minimum-window-substring/
• https://leetcode-cn.com/problems/burst-balloons/

高级动态规划

• 爬楼梯
• 不同路径
• 打家劫舍
• 最小路径和
• 股票买卖
• 爬楼梯
• 使用最小花费爬楼梯
• 编辑距离
• https://leetcode-cn.com/problems/longest-increasing-subsequence/
• https://leetcode-cn.com/problems/decode-ways/
• https://leetcode-cn.com/problems/longest-valid-parentheses/
• https://leetcode-cn.com/problems/maximal-rectangle/
• https://leetcode-cn.com/problems/distinct-subsequences/
• https://leetcode-cn.com/problems/race-car/