#Leetcode# 836. Rectangle Overlap

佚名 6年前 (2019-04-12) 随笔 493人围观抢沙发百度已收录

https://leetcode.com/problems/rectangle-overlap/

SRE实战互联网时代守护先锋，助力企业售后服务体系运筹帷幄！一键直达领取阿里云限量特价优惠。

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.

代码：

class Solution {
public:
    bool isRectangleOverlap(vector<int>& rec1, vector<int>& rec2) {
        int A = rec1[0], B = rec1[1], C = rec1[2], D = rec1[3];
        int E = rec2[0], F = rec2[1], G = rec2[2], H = rec2[3];
        
        if (E >= C || F >= D || B >= H || A >= G) return false;
        return true;
    }
};