feat: add typescript solution to lc problem: No.2201.Count Artifacts That Can Be Extracted

Author: zhaocchen

solution/2200-2299/2201.Count Artifacts That Can Be Extracted/README.md

@@ -87,7 +87,25 @@
 ### **TypeScript**
 
 ```ts
-
+function digArtifacts(n: number, artifacts: number[][], dig: number[][]): number {
+    let visited = Array.from({ length: n }, v => new Array(n).fill(false));
+    for (let [i, j] of dig) {
+        visited[i][j] = true;
+    }
+    let ans = 0;
+    for (let [a, b, c, d] of artifacts) {
+        let flag = true;
+        for (let i = a; i <= c && flag; i++) {
+            for (let j = b; j <= d && flag; j++) {
+                if(!visited[i][j]) {
+                    flag = false;
+                } 
+            }
+        }
+        flag && ans++;
+    }
+    return ans;
+};
 ```
 
 ### **...**

solution/2200-2299/2201.Count Artifacts That Can Be Extracted/README_EN.md

@@ -79,7 +79,25 @@ Thus, we return 1.
 ### **TypeScript**
 
 ```ts
-
+function digArtifacts(n: number, artifacts: number[][], dig: number[][]): number {
+    let visited = Array.from({ length: n }, v => new Array(n).fill(false));
+    for (let [i, j] of dig) {
+        visited[i][j] = true;
+    }
+    let ans = 0;
+    for (let [a, b, c, d] of artifacts) {
+        let flag = true;
+        for (let i = a; i <= c && flag; i++) {
+            for (let j = b; j <= d && flag; j++) {
+                if(!visited[i][j]) {
+                    flag = false;
+                } 
+            }
+        }
+        flag && ans++;
+    }
+    return ans;
+};
 ```
 
 ### **...**

solution/2200-2299/2201.Count Artifacts That Can Be Extracted/Solution.ts

@@ -0,0 +1,19 @@
+function digArtifacts(n: number, artifacts: number[][], dig: number[][]): number {
+    let visited = Array.from({ length: n }, v => new Array(n).fill(false));
+    for (let [i, j] of dig) {
+        visited[i][j] = true;
+    }
+    let ans = 0;
+    for (let [a, b, c, d] of artifacts) {
+        let flag = true;
+        for (let i = a; i <= c && flag; i++) {
+            for (let j = b; j <= d && flag; j++) {
+                if(!visited[i][j]) {
+                    flag = false;
+                } 
+            }
+        }
+        flag && ans++;
+    }
+    return ans;
+};