Class Solution
java.lang.Object
g0401_0500.s0497_random_point_in_non_overlapping_rectangles.Solution
497 - Random Point in Non-overlapping Rectangles.<p>Medium</p>
<p>You are given an array of non-overlapping axis-aligned rectangles <code>rects</code> where <code>rects[i] = [a<sub>i</sub>, b<sub>i</sub>, x<sub>i</sub>, y<sub>i</sub>]</code> indicates that <code>(a<sub>i</sub>, b<sub>i</sub>)</code> is the bottom-left corner point of the <code>i<sup>th</sup></code> rectangle and <code>(x<sub>i</sub>, y<sub>i</sub>)</code> is the top-right corner point of the <code>i<sup>th</sup></code> rectangle. Design an algorithm to pick a random integer point inside the space covered by one of the given rectangles. A point on the perimeter of a rectangle is included in the space covered by the rectangle.</p>
<p>Any integer point inside the space covered by one of the given rectangles should be equally likely to be returned.</p>
<p><strong>Note</strong> that an integer point is a point that has integer coordinates.</p>
<p>Implement the <code>Solution</code> class:</p>
<ul>
<li><code>Solution(int[][] rects)</code> Initializes the object with the given rectangles <code>rects</code>.</li>
<li><code>int[] pick()</code> Returns a random integer point <code>[u, v]</code> inside the space covered by one of the given rectangles.</li>
</ul>
<p><strong>Example 1:</strong></p>
<p><img src="https://assets.leetcode.com/uploads/2021/07/24/lc-pickrandomrec.jpg" alt="" /></p>
<p><strong>Input</strong> [“Solution”, “pick”, “pick”, “pick”, “pick”, “pick”] [<a href="[-2,--2,-1,-1],-[2,-2,-4,-6]">[-2, -2, 1, 1], [2, 2, 4, 6]</a>, [], [], [], [], []]</p>
<p><strong>Output:</strong> [null, [1, -2], [1, -1], [-1, -2], [-2, -2], [0, 0]]</p>
<p><strong>Explanation:</strong></p>
<pre><code> Solution solution = new Solution([[-2, -2, 1, 1], [2, 2, 4, 6]]);
solution.pick(); // return [1, -2]
solution.pick(); // return [1, -1]
solution.pick(); // return [-1, -2]
solution.pick(); // return [-2, -2]
solution.pick(); // return [0, 0]
</code></pre>
<p><strong>Constraints:</strong></p>
<ul>
<li><code>1 <= rects.length <= 100</code></li>
<li><code>rects[i].length == 4</code></li>
<li><code>-10<sup>9</sup> <= a<sub>i</sub> < x<sub>i</sub> <= 10<sup>9</sup></code></li>
<li><code>-10<sup>9</sup> <= b<sub>i</sub> < y<sub>i</sub> <= 10<sup>9</sup></code></li>
<li><code>x<sub>i</sub> - a<sub>i</sub> <= 2000</code></li>
<li><code>y<sub>i</sub> - b<sub>i</sub> <= 2000</code></li>
<li>All the rectangles do not overlap.</li>
<li>At most <code>10<sup>4</sup></code> calls will be made to <code>pick</code>.</li>
</ul>
-
Constructor Summary
Constructors -
Method Summary
-
Constructor Details
-
Solution
public Solution(int[][] rects)
-
-
Method Details
-
pick
public int[] pick()
-