836. Rectangle Overlap

最新推荐文章于 2020-12-09 18:43:42 发布

WhiteJunior

最新推荐文章于 2020-12-09 18:43:42 发布

阅读量203

点赞数

分类专栏： C++OJ LeetCode Self-Culture

本文链接：https://blog.csdn.net/lym940928/article/details/80444085

版权

Self-Culture 同时被 3 个专栏收录

751 篇文章 5 订阅

订阅专栏

C++OJ

406 篇文章 0 订阅

订阅专栏

LeetCode

406 篇文章 0 订阅

订阅专栏

1，题目要求
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 rectangles, return whether they overlap.
这里写图片描述
给出两个矩形，判断二者是否有重叠。

2，题目思路
首先，对于一维的线段而言，假设有两个线段，分别有：L1, R1, L2, R2。如果两个线段有重叠的部分，则一定有：
L1 < R2 && R2 < L1
因此，对于二维形式的矩形而言，只要分别将这个规则加到横坐标和纵坐标上即可达到目的。

3，程序源码

class Solution {
public:
    bool isRectangleOverlap(vector<int>& rec1, vector<int>& rec2) {
        return rec1[0] < rec2[2] && rec2[0] < rec1[2] && rec1[1] < rec2[3] && rec2[1] < rec1[3];
    }
};