本期介绍了【区间 DP】的两道经典题目:【最长回文子序列】和【多边形三角剖分的最低得分】。欢迎一键三连,也欢迎转发给你的朋友或刷题群~
Python/Java/C++/Go/JS/Rust 代码:
516. 最长回文子序列 https://leetcode.cn/problems/longest-palindromic-subsequence/solution/shi-pin-jiao-ni-yi-bu-bu-si-kao-dong-tai-kgkg/
1039. 多边形三角剖分的最低得分 https://leetcode.cn/problems/minimum-score-triangulation-of-polygon/solution/shi-pin-jiao-ni-yi-bu-bu-si-kao-dong-tai-aty6/
课后作业:
375. 猜数字大小 II https://leetcode.cn/problems/guess-number-higher-or-lower-ii/
132. 分割回文串 II https://leetcode.cn/problems/palindrome-partitioning-ii/
3040. 相同分数的最大操作数目 II https://leetcode.cn/problems/maximum-number-of-operations-with-the-same-score-ii/
1312. 让字符串成为回文串的最少插入次数 https://leetcode.cn/problems/minimum-insertion-steps-to-make-a-string-palindrome/
1770. 执行乘法运算的最大分数 https://leetcode.cn/problems/maximum-score-from-performing-multiplication-operations/
1771. 由子序列构造的最长回文串的长度 https://leetcode.cn/problems/maximize-palindrome-length-from-subsequences/
1547. 切棍子的最小成本 https://leetcode.cn/problems/minimum-cost-to-cut-a-stick/
1000. 合并石头的最低成本 https://leetcode.cn/problems/minimum-cost-to-merge-stones/
力扣最全 DP 题单:
https://leetcode.cn/circle/discuss/tXLS3i/
【基础算法精讲】题目+题解汇总:
https://github.com/EndlessCheng/codeforces-go/blob/master/leetcode/README.md