feat: add typescript solution to lc problem: No.2250

No.2250.Count Number of Rectangles Containing Each Point

Author: zhaocchen

solution/2200-2299/2250.Count Number of Rectangles Containing Each Point/README.md

@@ -85,7 +85,35 @@
 ### **TypeScript**
 
 ```ts
-
+function countRectangles(rectangles: number[][], points: number[][]): number[] {
+    const n = 101;
+    let ymap = Array.from({ length: n }, v => []);
+    for (let [x, y] of rectangles) {
+        ymap[y].push(x);
+    }
+    for (let nums of ymap) {
+        nums.sort((a, b) => a - b);
+    }
+    let ans = [];
+    for (let [x, y] of points) {
+        let count = 0;
+        for (let h = y; h < n; h++) {
+            const nums = ymap[h];
+            let left = 0, right = nums.length;
+            while (left < right) {
+                let mid = (left + right) >> 1;
+                if (x > nums[mid]) {
+                    left = mid + 1;
+                } else {
+                    right = mid;
+                }
+            }
+            count += (nums.length - right);
+        }
+        ans.push(count);
+    }
+    return ans;
+};
 ```
 
 ### **...**

solution/2200-2299/2250.Count Number of Rectangles Containing Each Point/README_EN.md

@@ -72,7 +72,35 @@ Therefore, we return [1, 3].
 ### **TypeScript**
 
 ```ts
-
+function countRectangles(rectangles: number[][], points: number[][]): number[] {
+    const n = 101;
+    let ymap = Array.from({ length: n }, v => []);
+    for (let [x, y] of rectangles) {
+        ymap[y].push(x);
+    }
+    for (let nums of ymap) {
+        nums.sort((a, b) => a - b);
+    }
+    let ans = [];
+    for (let [x, y] of points) {
+        let count = 0;
+        for (let h = y; h < n; h++) {
+            const nums = ymap[h];
+            let left = 0, right = nums.length;
+            while (left < right) {
+                let mid = (left + right) >> 1;
+                if (x > nums[mid]) {
+                    left = mid + 1;
+                } else {
+                    right = mid;
+                }
+            }
+            count += (nums.length - right);
+        }
+        ans.push(count);
+    }
+    return ans;
+};
 ```
 
 ### **...**

solution/2200-2299/2250.Count Number of Rectangles Containing Each Point/Solution.ts

@@ -0,0 +1,29 @@
+function countRectangles(rectangles: number[][], points: number[][]): number[] {
+    const n = 101;
+    let ymap = Array.from({ length: n }, v => []);
+    for (let [x, y] of rectangles) {
+        ymap[y].push(x);
+    }
+    for (let nums of ymap) {
+        nums.sort((a, b) => a - b);
+    }
+    let ans = [];
+    for (let [x, y] of points) {
+        let count = 0;
+        for (let h = y; h < n; h++) {
+            const nums = ymap[h];
+            let left = 0, right = nums.length;
+            while (left < right) {
+                let mid = (left + right) >> 1;
+                if (x > nums[mid]) {
+                    left = mid + 1;
+                } else {
+                    right = mid;
+                }
+            }
+            count += (nums.length - right);
+        }
+        ans.push(count);
+    }
+    return ans;
+};