feat: add typescript solution to lc problem: No.1893.Check if All the Integers in a Range Are Covered

Author: zhaocchen

solution/1800-1899/1893.Check if All the Integers in a Range Are Covered/README.md

@@ -95,6 +95,26 @@ class Solution {
 }
 ```
 
+### **TypeScript**
+
+```ts
+function isCovered(ranges: number[][], left: number, right: number): boolean {
+    let diff = new Array(52).fill(0);
+    for (let [start, end] of ranges) {
+        ++diff[start];
+        --diff[end + 1];
+    }
+    let cur = 0;
+    for (let i = 1; i <= 50; i++) {
+        cur += diff[i];
+        if (i >= left && i <= right && cur <= 0) {
+            return false;
+        }
+    }
+    return true;
+};
+```
+
 ### **Go**
 
 ```go

solution/1800-1899/1893.Check if All the Integers in a Range Are Covered/README_EN.md

@@ -85,6 +85,26 @@ class Solution {
 }
 ```
 
+### **TypeScript**
+
+```ts
+function isCovered(ranges: number[][], left: number, right: number): boolean {
+    let diff = new Array(52).fill(0);
+    for (let [start, end] of ranges) {
+        ++diff[start];
+        --diff[end + 1];
+    }
+    let cur = 0;
+    for (let i = 1; i <= 50; i++) {
+        cur += diff[i];
+        if (i >= left && i <= right && cur <= 0) {
+            return false;
+        }
+    }
+    return true;
+};
+```
+
 ### **Go**
 
 ```go

solution/1800-1899/1893.Check if All the Integers in a Range Are Covered/Solution.ts

@@ -0,0 +1,15 @@
+function isCovered(ranges: number[][], left: number, right: number): boolean {
+    let diff = new Array(52).fill(0);
+    for (let [start, end] of ranges) {
+        ++diff[start];
+        --diff[end + 1];
+    }
+    let cur = 0;
+    for (let i = 1; i <= 50; i++) {
+        cur += diff[i];
+        if (i >= left && i <= right && cur <= 0) {
+            return false;
+        }
+    }
+    return true;
+};