Exercise: Dynamic Programming Problems I
labuladongOriginalAbout 8932 words
343. 整数拆分 https://leetcode.cn/problems/integer-break
343. Integer Break https://leetcode.com/problems/integer-break
63. 不同路径 II https://leetcode.cn/problems/unique-paths-ii
63. Unique Paths II https://leetcode.com/problems/unique-paths-ii
1262. 可被三整除的最大和 https://leetcode.cn/problems/greatest-sum-divisible-by-three
1262. Greatest Sum Divisible by Three https://leetcode.com/problems/greatest-sum-divisible-by-three
120. 三角形最小路径和 https://leetcode.cn/problems/triangle
120. Triangle https://leetcode.com/problems/triangle
368. 最大整除子集 https://leetcode.cn/problems/largest-divisible-subset
368. Largest Divisible Subset https://leetcode.com/problems/largest-divisible-subset
718. 最长重复子数组 https://leetcode.cn/problems/maximum-length-of-repeated-subarray
718. Maximum Length of Repeated Subarray https://leetcode.com/problems/maximum-length-of-repeated-subarray
Prerequisites
Before reading this article, you need to learn:
This chapter lists some classic dynamic programming exercises to help deepen the understanding of the concepts discussed in the previous articles.
