本期介绍了【最长递增子序列】O(n^2) 和 O(nlogn) 的两种写法,以及 O(1) 额外空间的写法,欢迎一键三连~
Python/Java/C++/Go 代码:
300. 最长递增子序列 https://leetcode.cn/problems/longest-increasing-subsequence/solution/jiao-ni-yi-bu-bu-si-kao-dpfu-o1-kong-jia-4zma/
课后作业:
2826. 将三个组排序 https://leetcode.cn/problems/sorting-three-groups/
1964. 找出到每个位置为止最长的有效障碍赛跑路线 https://leetcode.cn/problems/find-the-longest-valid-obstacle-course-at-each-position/
1671. 得到山形数组的最少删除次数 https://leetcode.cn/problems/minimum-number-of-removals-to-make-mountain-array/
2111. 使数组 K 递增的最少操作次数 https://leetcode.cn/problems/minimum-operations-to-make-the-array-k-increasing/
354. 俄罗斯套娃信封问题 https://leetcode.cn/problems/russian-doll-envelopes/
1626. 无矛盾的最佳球队 https://leetcode.cn/problems/best-team-with-no-conflicts/
1187. 使数组严格递增 https://leetcode.cn/problems/make-array-strictly-increasing/
力扣最全 DP 题单:
https://leetcode.cn/circle/discuss/tXLS3i/
【基础算法精讲】题目+题解汇总:
https://github.com/EndlessCheng/codeforces-go/blob/master/leetcode/README.md