algorithm/leetcode-master
1
0
Fork 0
mirror of https://github.com/youngyangyang04/leetcode-master.git synced 2025-07-09 03:34:02 +08:00
Code Issues Packages Projects Releases Wiki Activity

docs: 无重叠区间添加视频链接

Browse Source
This commit is contained in:
liangzhensheng
2023-03-17 11:31:35 +08:00
parent 3f904211ca
commit 403f524b3f
1 changed files with 4 additions and 0 deletions
Download Patch File Download Diff File Expand all files Collapse all files

4
problems/0435.无重叠区间.md
View File

@ -30,6 +30,10 @@
* 输出: 0
* 解释: 你不需要移除任何区间，因为它们已经是无重叠的了。
# 视频讲解
**《代码随想录》算法视频公开课：[贪心算法，依然是判断重叠区间 | LeetCode：435.无重叠区间](https://www.bilibili.com/video/BV1A14y1c7E1)，相信结合视频在看本篇题解，更有助于大家对本题的理解**。
## 思路
**相信很多同学看到这道题目都冥冥之中感觉要排序，但是究竟是按照右边界排序，还是按照左边界排序呢？**