Skip to content

✨update: Modify 1893 #461

New issue

Have a question about this project? Sign up for a free GitHub account to open an issue and contact its maintainers and the community.

Sign up for GitHub

By clicking “Sign up for GitHub”, you agree to our terms of service and privacy statement. We’ll occasionally send you account related emails.

Already on GitHub? Sign in to your account

Merged
merged 1 commit into from
Apr 12, 2022
Merged

✨update: Modify 1893 #461

Changes from all commits
Commits
Show all changes
1 commit
Select commit
File filter

Filter by extension

Filter by extension
Conversations
Failed to load comments.
Loading
Jump to
Jump to file
Failed to load files.
Loading
Diff view
Diff view
12 changes: 6 additions & 6 deletions LeetCode/1891-1900/1893. 检查是否区域内所有整数都被覆盖（简单）.md
View file
Open in desktop
Original file line number Diff line number Diff line change
Expand Up @@ -6,11 +6,11 @@ Tag : 「模拟」、「树状数组」、「线段树」



给你一个二维整数数组 ranges 和两个整数 left 和 right 。每个 ranges[i] = [starti, endi] 表示一个从 starti 到 endi 的 闭区间 。
给你一个二维整数数组 `ranges` 和两个整数 `left` 和 `right`。每个 $ranges[i] = [start_i, end_i]$ 表示一个从 $start_i$ 到 $end_i$ 的 闭区间 。

如果闭区间 [left, right] 内每个整数都被 ranges 中 至少一个 区间覆盖，那么请你返回 true ，否则返回 false 。
如果闭区间 $[left, right]$ 内每个整数都被 `ranges` 中 至少一个 区间覆盖，那么请你返回 `true`，否则返回 `false`。

已知区间 ranges[i] = [starti, endi] ，如果整数 x 满足 starti <= x <= endi ，那么我们称整数x 被覆盖了。
已知区间 $ranges[i] = [start_i, end_i]$，如果整数 `x` 满足 $start_i <= x <= end_i$，那么我们称整数 `x` 被覆盖了。

示例 1：
```
Expand All @@ -33,9 +33,9 @@ Tag : 「模拟」、「树状数组」、「线段树」
```

提示：
* 1 <= ranges.length <= 50
* 1 <= starti <= endi <= 50
* 1 <= left <= right <= 50
* $1 <= ranges.length <= 50$
* $1 <= start_i <= end_i <= 50$
* $1 <= left <= right <= 50$

---

Expand Down