LeetCode-Rectangle Overlap

Description：
A rectangle is represented as a list [x1, y1, x2, y2], where (x1, y1) are the coordinates of its bottom-left corner, and (x2, y2) are the coordinates of its top-right corner.

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, return whether they overlap.

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

Notes:

• Both rectangles rec1 and rec2 are lists of 4 integers.
• All coordinates in rectangles will be between -10^9 and 10^9.

题意：给定以笛卡尔坐标系表示的两个矩形，用左下角坐标和右上角坐标表示一个矩形，计算两个矩形是否有重叠的部分（重叠部分的面积需要大于零，因此，仅仅边重合是不计算在内的）；

解法：如果我们要去判断是否重叠，不如去判断是否不重叠；不重叠的情况有如下四种：

Java

class Solution {
    public boolean isRectangleOverlap(int[] rec1, int[] rec2) {
        if (rec2[0] >= rec1[2]) return false;
        if (rec2[3] <= rec1[1]) return false;
        if (rec2[2] <= rec1[0]) return false;
        if (rec2[1] >= rec1[3]) return false;
        return true;
    }
}