Solution (leetcode-in-java 1.5 API)

java.lang.Object
- g0401_0500.s0497_random_point_in_non_overlapping_rectangles.Solution

```
public class Solution
extends Object
```
497 - Random Point in Non-overlapping Rectangles.

Medium

You are given an array of non-overlapping axis-aligned rectangles rects where rects[i] = [a_i, b_i, x_i, y_i] indicates that (a_i, b_i) is the bottom-left corner point of the i^th rectangle and (x_i, y_i) is the top-right corner point of the i^th 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.

Any integer point inside the space covered by one of the given rectangles should be equally likely to be returned.

Note that an integer point is a point that has integer coordinates.

Implement the Solution class:
- Solution(int[][] rects) Initializes the object with the given rectangles rects.
- int[] pick() Returns a random integer point [u, v] inside the space covered by one of the given rectangles.
Example 1:

Input [“Solution”, “pick”, “pick”, “pick”, “pick”, “pick”] [[[[-2, -2, 1, 1], [2, 2, 4, 6]]], [], [], [], [], []]

Output: [null, [1, -2], [1, -1], [-1, -2], [-2, -2], [0, 0]]

Explanation:
```
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]
```
Constraints:
- 1 <= rects.length <= 100
- rects[i].length == 4
- -10⁹ <= a_i < x_i <= 10⁹
- -10⁹ <= b_i < y_i <= 10⁹
- x_i - a_i <= 2000
- y_i - b_i <= 2000
- All the rectangles do not overlap.
- At most 10⁴ calls will be made to pick.

- Constructor Summary
  
  Constructors
  Constructor and Description
  
  Solution(int[][] rects)
- Method Summary
  
  All Methods Instance Methods Concrete Methods
  Modifier and Type Method and Description
  
  int[] pick()
  - Methods inherited from class java.lang.Object
    clone, equals, finalize, getClass, hashCode, notify, notifyAll, toString, wait, wait, wait

Constructors
Constructor and Description
`Solution(int[][] rects)`

All Methods Instance Methods Concrete Methods
Modifier and Type	Method and Description
`int[]`	`pick()`

Constructor Detail
- Solution
```
public Solution(int[][] rects)
```

Method Detail
- pick
```
public int[] pick()
```

Class Solution

Constructor Summary

Method Summary

Methods inherited from class java.lang.Object

Constructor Detail

Solution

Method Detail

pick