mirror of
https://gitee.com/coder-xiaomo/leetcode-problemset
synced 2025-01-10 18:48:13 +08:00
49 lines
3.0 KiB
HTML
49 lines
3.0 KiB
HTML
<p>You are given a 2D integer array <code>rectangles</code> where <code>rectangles[i] = [l<sub>i</sub>, h<sub>i</sub>]</code> indicates that <code>i<sup>th</sup></code> rectangle has a length of <code>l<sub>i</sub></code> and a height of <code>h<sub>i</sub></code>. You are also given a 2D integer array <code>points</code> where <code>points[j] = [x<sub>j</sub>, y<sub>j</sub>]</code> is a point with coordinates <code>(x<sub>j</sub>, y<sub>j</sub>)</code>.</p>
|
|
|
|
<p>The <code>i<sup>th</sup></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<sub>i</sub>, h<sub>i</sub>)</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<sup>th</sup></code><em> point.</em></p>
|
|
|
|
<p>The <code>i<sup>th</sup></code> rectangle <strong>contains</strong> the <code>j<sup>th</sup></code> point if <code>0 <= x<sub>j</sub> <= l<sub>i</sub></code> and <code>0 <= y<sub>j</sub> <= h<sub>i</sub></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> </p>
|
|
<p><strong class="example">Example 1:</strong></p>
|
|
<img alt="" src="https://assets.leetcode.com/uploads/2022/03/02/example1.png" style="width: 300px; height: 509px;" />
|
|
<pre>
|
|
<strong>Input:</strong> rectangles = [[1,2],[2,3],[2,5]], points = [[2,1],[1,4]]
|
|
<strong>Output:</strong> [2,1]
|
|
<strong>Explanation:</strong>
|
|
The first rectangle contains no points.
|
|
The second rectangle contains only the point (2, 1).
|
|
The third rectangle contains the points (2, 1) and (1, 4).
|
|
The number of rectangles that contain the point (2, 1) is 2.
|
|
The number of rectangles that contain the point (1, 4) is 1.
|
|
Therefore, we return [2, 1].
|
|
</pre>
|
|
|
|
<p><strong class="example">Example 2:</strong></p>
|
|
<img alt="" src="https://assets.leetcode.com/uploads/2022/03/02/example2.png" style="width: 300px; height: 312px;" />
|
|
<pre>
|
|
<strong>Input:</strong> rectangles = [[1,1],[2,2],[3,3]], points = [[1,3],[1,1]]
|
|
<strong>Output:</strong> [1,3]
|
|
<strong>Explanation:
|
|
</strong>The first rectangle contains only the point (1, 1).
|
|
The second rectangle contains only the point (1, 1).
|
|
The third rectangle contains the points (1, 3) and (1, 1).
|
|
The number of rectangles that contain the point (1, 3) is 1.
|
|
The number of rectangles that contain the point (1, 1) is 3.
|
|
Therefore, we return [1, 3].
|
|
</pre>
|
|
|
|
<p> </p>
|
|
<p><strong>Constraints:</strong></p>
|
|
|
|
<ul>
|
|
<li><code>1 <= rectangles.length, points.length <= 5 * 10<sup>4</sup></code></li>
|
|
<li><code>rectangles[i].length == points[j].length == 2</code></li>
|
|
<li><code>1 <= l<sub>i</sub>, x<sub>j</sub> <= 10<sup>9</sup></code></li>
|
|
<li><code>1 <= h<sub>i</sub>, y<sub>j</sub> <= 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>
|