diff options
| author | Darren Yao | 2020-07-20 14:07:42 -0700 |
|---|---|---|
| committer | GitHub | 2020-07-20 14:07:42 -0700 |
| commit | fce814c8f7cef5250e9763f287d589ac9e70e5a7 (patch) | |
| tree | bb091fad266e731cb46996d40ba8f891a8b70eb1 | |
| parent | df576bae029d0e22f5e0f6e4a4954db4485b90ef (diff) | |
Update Rect_Geo.mdx
| -rw-r--r-- | content/2_Bronze/Rect_Geo.mdx | 12 |
1 files changed, 6 insertions, 6 deletions
diff --git a/content/2_Bronze/Rect_Geo.mdx b/content/2_Bronze/Rect_Geo.mdx index ca83c39..657804e 100644 --- a/content/2_Bronze/Rect_Geo.mdx +++ b/content/2_Bronze/Rect_Geo.mdx @@ -89,13 +89,13 @@ To create a new rectangle, use the following constructor: Rectangle newRect = new Rectangle(x, y, width, height); ``` -The `Rectangle` class supports numerous useful methods. +The `Rectangle` class supports numerous useful methods, including the following: - - `firstRect.intersects(secondRect)` checks if two rectangles intersect. - - `firstRect.union(secondRect)` returns a rectangle representing the union of two rectangles. - - `firstRect.contains(x, y)` checks whether the integer point $(x,y)$ exists in firstRect. - - `firstRect.intersection(secondRect)` returns a rectangle representing the intersection of two rectangles. - - what happens when intersection is empty? +- `firstRect.intersects(secondRect)` checks if two rectangles intersect. +- `firstRect.union(secondRect)` returns a rectangle representing the union of two rectangles. +- `firstRect.contains(x, y)` checks whether the integer point $(x,y)$ exists in firstRect. +- `firstRect.intersection(secondRect)` returns a rectangle representing the intersection of two rectangles. +- what happens when intersection is empty? This class can often lessen the implementation needed in a lot of bronze problems and CodeForces problems. |