[LeetCode] Determine if two rectangles overlap

Given two axis-aligned rectangles A and B. Write a function to determine if the two rectangles overlap.

从问题的反面入手,先看看什么情况下两个长方形不重叠。


不重叠的条件是:( P2.y < P3.y || P1.y > P4.y || P2.x < P3.x || P1.x > P4.x )

直接给代码:

struct Point
{
    int x, y;
};
 
// Returns true if two rectangles (l1, r1) and (l2, r2) overlap
bool doOverlap(Point l1, Point r1, Point l2, Point r2)
{
    // If one rectangle is on left side of other
    if (l1.x > r2.x || l2.x > r1.x)
        return false;
 
    // If one rectangle is above other
    if (l1.y < r2.y || l2.y < r1.y)
        return false;
 
    return true;
}


你可能感兴趣的:(LeetCode)