feat: add typescript solution to lc problem: No.1828.Queries on Number of Points Inside a Circle (doocs#481)

Author: zhaocchen

solution/1800-1899/1828.Queries on Number of Points Inside a Circle/README.md

@@ -98,6 +98,25 @@ class Solution {
 }
 ```
 
+### **TypeScript**
+
+```ts
+function countPoints(points: number[][], queries: number[][]): number[] {
+    let ans = [];
+    for (let [cx, cy, r] of queries) {
+        let square = r ** 2;
+        let count = 0;
+        for (let [px, py] of points) {
+            if ((px - cx) ** 2 + (py - cy) ** 2 <= square) {
+                ++count;
+            }
+        }
+        ans.push(count);
+    }
+    return ans;
+};
+```
+
 ### **C++**
 
 ```cpp

solution/1800-1899/1828.Queries on Number of Points Inside a Circle/README_EN.md

@@ -91,6 +91,25 @@ class Solution {
 }
 ```
 
+### **TypeScript**
+
+```ts
+function countPoints(points: number[][], queries: number[][]): number[] {
+    let ans = [];
+    for (let [cx, cy, r] of queries) {
+        let square = r ** 2;
+        let count = 0;
+        for (let [px, py] of points) {
+            if ((px - cx) ** 2 + (py - cy) ** 2 <= square) {
+                ++count;
+            }
+        }
+        ans.push(count);
+    }
+    return ans;
+};
+```
+
 ### **C++**
 
 ```cpp

solution/1800-1899/1828.Queries on Number of Points Inside a Circle/Solution.ts

@@ -0,0 +1,14 @@
+function countPoints(points: number[][], queries: number[][]): number[] {
+    let ans = [];
+    for (let [cx, cy, r] of queries) {
+        let square = r ** 2;
+        let count = 0;
+        for (let [px, py] of points) {
+            if ((px - cx) ** 2 + (py - cy) ** 2 <= square) {
+                ++count;
+            }
+        }
+        ans.push(count);
+    }
+    return ans;
+};