Package g2201_2300.s2250_count_number_of_rectangles_containing_each_point

Class Solution

java.lang.Object

g2201_2300.s2250_count_number_of_rectangles_containing_each_point.Solution

public class Solution
extends Object

2250 - Count Number of Rectangles Containing Each Point.<p>Medium</p> <p>You are given a 2D integer array <code>rectangles</code> where <code>rectangles[i] = [l_i, h_i]</code> indicates that <code>i^th</code> rectangle has a length of <code>l_i</code> and a height of <code>h_i</code>. You are also given a 2D integer array <code>points</code> where <code>points[j] = [x_j, y_j]</code> is a point with coordinates <code>(x_j, y_j)</code>.</p> <p>The <code>i^th</code> rectangle has its <strong>bottom-left corner</strong> point at the coordinates <code>(0, 0)</code> and its <strong>top-right corner</strong> point at <code>(l_i, h_i)</code>.</p> <p>Return <em>an integer array</em> <code>count</code> <em>of length</em> <code>points.length</code> <em>where</em> <code>count[j]</code> <em>is the number of rectangles that <strong>contain</strong> the</em> <code>j^th</code> <em>point.</em></p> <p>The <code>i^th</code> rectangle <strong>contains</strong> the <code>j^th</code> point if <code>0 <= x_j <= l_i</code> and <code>0 <= y_j <= h_i</code>. Note that points that lie on the <strong>edges</strong> of a rectangle are also considered to be contained by that rectangle.</p> <p><strong>Example 1:</strong></p> <p><img src="https://assets.leetcode.com/uploads/2022/03/02/example1.png" alt="" /></p> <p><strong>Input:</strong> rectangles = [[1,2],[2,3],[2,5]], points = [[2,1],[1,4]]</p> <p><strong>Output:</strong> [2,1]</p> <p><strong>Explanation:</strong></p> <p>The first rectangle contains no points.</p> <p>The second rectangle contains only the point (2, 1).</p> <p>The third rectangle contains the points (2, 1) and (1, 4).</p> <p>The number of rectangles that contain the point (2, 1) is 2.</p> <p>The number of rectangles that contain the point (1, 4) is 1.</p> <p>Therefore, we return [2, 1].</p> <p><strong>Example 2:</strong></p> <p><img src="https://assets.leetcode.com/uploads/2022/03/02/example2.png" alt="" /></p> <p><strong>Input:</strong> rectangles = [[1,1],[2,2],[3,3]], points = [[1,3],[1,1]]</p> <p><strong>Output:</strong> [1,3]</p> <p><strong>Explanation:</strong></p> <p>The first rectangle contains only the point (1, 1).</p> <p>The second rectangle contains only the point (1, 1).</p> <p>The third rectangle contains the points (1, 3) and (1, 1).</p> <p>The number of rectangles that contain the point (1, 3) is 1.</p> <p>The number of rectangles that contain the point (1, 1) is 3.</p> <p>Therefore, we return [1, 3].</p> <p><strong>Constraints:</strong></p> <ul> <li><code>1 <= rectangles.length, points.length <= 5 * 10⁴</code></li> <li><code>rectangles[i].length == points[j].length == 2</code></li> <li><code>1 <= l_i, x_j <= 10⁹</code></li> <li><code>1 <= h_i, y_j <= 100</code></li> <li>All the <code>rectangles</code> are <strong>unique</strong>.</li> <li>All the <code>points</code> are <strong>unique</strong>.</li> </ul>

Constructor Summary

Constructors

Constructor	Description
Solution()

Method Summary

Modifier and Type	Method	Description
int[]	countRectangles(int[][] rectangles, int[][] points)

Methods inherited from class java.lang.Object

clone, equals, finalize, getClass, hashCode, notify, notifyAll, toString, wait, wait, wait

Constructor Details

Solution

public Solution()

Method Details

countRectangles

public int[] countRectangles(int[][] rectangles,
 int[][] points)