Check if All the Integers in a Range Are Covered LeetCode solution in JavaScript

1
/**
2
* @param {number[][]} ranges
3
* @param {number} left
4
* @param {number} right
5
* @return {boolean}
6
*/
7
var isCovered = function (ranges, left, right) {
8
let z = 0,
9
f = 0,
10
e = [];
11
let a = ranges.flat(Infinity);
12

13
function abc(c, d) {
14
for (let i = c; i <= d; i++) if (e[i] == i) e[i] = null;
15
}
16
for (let i = left; i <= right; i++) e[i] = i;
17
for (let i = 0; i < a.length; i = i + 2) {
18
if (a[i] <= left && a[i + 1] >= right) return true;
19
else if (a[i] > right) continue;
20
else abc(a[i], a[i + 1]);
21
}
22
for (let i = left; i <= right; i++) if (e[i] != null) return false;
23

24
return true;
25
};

0

WPM •0 •0

100%

ACC •0 •0

0s

TIME •0