1
0
mirror of https://gitee.com/coder-xiaomo/leetcode-problemset synced 2025-09-11 18:31:41 +08:00
Code Issues Projects Releases Wiki Activity GitHub Gitee

批量更新数据

This commit is contained in:
2025-01-09 20:29:41 +08:00
parent 04ecea043d
commit 48cdd06c2b
5053 changed files with 156164 additions and 135322 deletions

View File

@@ -1,5 +1,7 @@
<p>给定一个区间的集合&nbsp;<code>intervals</code>&nbsp;,其中 <code>intervals[i] = [start<sub>i</sub>, end<sub>i</sub>]</code>&nbsp;。返回 <em>需要移除区间的最小数量,使剩余区间互不重叠&nbsp;</em></p>
<p><strong>注意</strong>&nbsp;只在一点上接触的区间是&nbsp;<strong>不重叠的</strong>。例如&nbsp;<code>[1, 2]</code>&nbsp;&nbsp;<code>[2, 3]</code>&nbsp;是不重叠的。</p>
<p>&nbsp;</p>
<p><strong>示例 1:</strong></p>