836. 矩形重叠

class Solution {

public:

    bool isRectangleOverlap(vector<int>& rec1, vector<int>& rec2) {

        int overlapmin_x = max(rec1[0], rec2[0]);

        int overlapmax_x = min(rec1[2], rec2[2]);

        int overlapmin_y = max(rec1[1], rec2[1]);

        int overlapmax_y = min(rec1[3], rec2[3]);

        return overlapmin_x < overlapmax_x && overlapmin_y < overlapmax_y;



    }
};

类似IOU（intersection-over-union）的计算方式，IOU就是double类型，然后把overlap的长乘以宽就得到重叠的面积。