动态规划 https://leetcode.cn/problems/cherry-pickup-ii https://leetcode.cn/problems/cherry-pickup https://leetcode.cn/problems/maximum-profit-in-job-scheduling (二分,排序) 记忆化搜索 https://leetcode.cn/problems/minimum-number-of-days-to-eat-n-oranges (min(n/2, n/3)) 滑动窗口 https://leetcode.cn/problems/defuse-the-bomb 优先队列 https://leetcode.cn/problems/minimum-cost-to-hire-k-workers