LeetCode [836] Rectangle Overlap

 836. Rectangle Overlap

Easy

An axis-aligned rectangle is represented as a list [x1, y1, x2, y2], where (x1, y1) is the coordinate of its bottom-left corner, and (x2, y2) is the coordinate of its top-right corner. Its top and bottom edges are parallel to the X-axis, and its left and right edges are parallel to the Y-axis.

Two rectangles overlap if the area of their intersection is positive. To be clear, two rectangles that only touch at the corner or edges do not overlap.

Given two axis-aligned rectangles rec1 and rec2, return true if they overlap, otherwise return false.

 

Example 1:

Input: rec1 = [0,0,2,2], rec2 = [1,1,3,3]
Output: true

Example 2:

Input: rec1 = [0,0,1,1], rec2 = [1,0,2,1]
Output: false

Example 3:

Input: rec1 = [0,0,1,1], rec2 = [2,2,3,3]
Output: false

 

Constraints:

• rect1.length == 4
• rect2.length == 4
• -109 <= rec1[i], rec2[i] <= 109
• rec1[0] <= rec1[2] and rec1[1] <= rec1[3]
• rec2[0] <= rec2[2] and rec2[1] <= rec2[3]

1 2 3 4 5 6 7 8 9 10 11

class Solution { public boolean isRectangleOverlap(int[] rec1, int[] rec2) { int x1a = rec1[0], y1a = rec1[1], x2a = rec1[2], y2a = rec1[3]; int x1b = rec2[0], y1b = rec2[1], x2b = rec2[2], y2b = rec2[3]; boolean xo = Math.max(x1a, x1b)<Math.min(x2a, x2b); boolean yo = Math.max(y1a, y1b)<Math.min(y2a, y2b); return xo&&yo; } }