836. 矩形重叠

最新推荐文章于 2024-09-15 15:43:59 发布

Lillian_cl

最新推荐文章于 2024-09-15 15:43:59 发布

阅读量200

点赞数

文章标签： leetcode

本文链接：https://blog.csdn.net/Lillian_cl/article/details/104938601

版权

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的长乘以宽就得到重叠的面积。