Commit b83a7df

authored

Merge pull request SharingSource#461 from SharingSource/ac_oier

✨update: Modify 1893

2 parents 2eef2ca + 7e25f00 commit b83a7dfCopy full SHA for b83a7df

File tree

-6

lines changed

-6

lines changed

Lines changed: 6 additions & 6 deletions

Original file line number	Diff line number	Diff line change
`@@ -6,11 +6,11 @@ Tag : 「模拟」、「树状数组」、「线段树」`
`6`	`6`
`7`	`7`
`8`	`8`
`9`		`-给你一个二维整数数组 ranges 和两个整数 left 和 right。每个 ranges[i] = [starti, endi] 表示一个从 starti 到 endi 的闭区间。`
	`9`	+给你一个二维整数数组 `ranges` 和两个整数 `left` 和 `right`。每个 $ranges[i] = [start_i, end_i]$ 表示一个从 $start_i$ 到 $end_i$ 的闭区间。
`10`	`10`
`11`		`-如果闭区间 [left, right] 内每个整数都被 ranges 中至少一个区间覆盖,那么请你返回 true,否则返回 false。`
	`11`	+如果闭区间 $[left, right]$ 内每个整数都被 `ranges` 中至少一个区间覆盖,那么请你返回 `true`,否则返回 `false`。
`12`	`12`
`13`		`-已知区间 ranges[i] = [starti, endi],如果整数 x 满足 starti <= x <= endi ,那么我们称整数x 被覆盖了。`
	`13`	+已知区间 $ranges[i] = [start_i, end_i]$,如果整数 `x` 满足 $start_i <= x <= end_i,ドル那么我们称整数 `x` 被覆盖了。
`14`	`14`
`15`	`15`	`示例 1:`
`16`	`16`	```
`@@ -33,9 +33,9 @@ Tag : 「模拟」、「树状数组」、「线段树」`
`33`	`33`	```
`34`	`34`
`35`	`35`	`提示:`
`36`		`-* 1 <= ranges.length <= 50`
`37`		`-* 1 <= starti <= endi <= 50`
`38`		`-* 1 <= left <= right <= 50`
	`36`	`+* $1 <= ranges.length <= 50$`
	`37`	`+* $1 <= start_i <= end_i <= 50$`
	`38`	`+* $1 <= left <= right <= 50$`
`39`	`39`
`40`	`40`	`---`
`41`	`41`

Comments

(0)