diff --git a/solution/1800-1899/1828.Queries on Number of Points Inside a Circle/README.md b/solution/1800-1899/1828.Queries on Number of Points Inside a Circle/README.md index b61190a972421..385a43833a766 100644 --- a/solution/1800-1899/1828.Queries on Number of Points Inside a Circle/README.md +++ b/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 diff --git a/solution/1800-1899/1828.Queries on Number of Points Inside a Circle/README_EN.md b/solution/1800-1899/1828.Queries on Number of Points Inside a Circle/README_EN.md index 34820f4339465..a21ba1c287a60 100644 --- a/solution/1800-1899/1828.Queries on Number of Points Inside a Circle/README_EN.md +++ b/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 diff --git a/solution/1800-1899/1828.Queries on Number of Points Inside a Circle/Solution.ts b/solution/1800-1899/1828.Queries on Number of Points Inside a Circle/Solution.ts new file mode 100644 index 0000000000000..372931b147c7f --- /dev/null +++ b/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; +}; \ No newline at end of file