LeetCode 836. 矩形重叠

解题思路

相关代码

class Solution {
    public boolean isRectangleOverlap(int[] rec1, int[] rec2) {
        int x1 = rec1[0];
        int y1 = rec1[1];
        int x2 = rec1[2];
        int y2 = rec1[3];
        int a1 = rec2[0];
        int b1 = rec2[1];
        int a2 = rec2[2];
        int b2 = rec2[3];

    return Math.min(y2,b2)>Math.max(y1,b1)&&Math.min(x2,a2)>Math.max(x1,a1);
    }
}