2140. 解决智力问题 https://leetcode.cn/problems/solving-questions-with-brainpower
2140. Solving Questions With Brainpower https://leetcode.com/problems/solving-questions-with-brainpower
2320. 统计放置房子的方式数 https://leetcode.cn/problems/count-number-of-ways-to-place-houses
2320. Count Number of Ways to Place Houses https://leetcode.com/problems/count-number-of-ways-to-place-houses
983. 最低票价 https://leetcode.cn/problems/minimum-cost-for-tickets
983. Minimum Cost For Tickets https://leetcode.com/problems/minimum-cost-for-tickets
740. 删除并获得点数 https://leetcode.cn/problems/delete-and-earn
740. Delete and Earn https://leetcode.com/problems/delete-and-earn
2611. 老鼠和奶酪 https://leetcode.cn/problems/mice-and-cheese
2611. Mice and Cheese https://leetcode.com/problems/mice-and-cheese
2789. 合并后数组中的最大元素 https://leetcode.cn/problems/largest-element-in-an-array-after-merge-operations
2789. Largest Element in an Array after Merge Operations https://leetcode.com/problems/largest-element-in-an-array-after-merge-operations
对于动态规划类型的问题，读者总是说不知道如何设置 dp 函数/数组的定义。其实也不要畏惧，想办法往已知的题目、算法框架上靠，步步为营，总能找到一些突破口。
那么本文列举一些题目，它们的解法思路和 打家劫舍系列问题 有些类似，可以帮助大家强化这类题目的求解能力。
