836. Rectangle Overlap（python+cpp）

题目：

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 coordinatesin rectangles will be between -10⁹ and 10⁹.

解释：
判断两个矩形是否相交。这种时候考虑所有不相交的情况更简单。
python代码：

class Solution:
    def isRectangleOverlap(self, rec1, rec2):
        """
        :type rec1: List[int]
        :type rec2: List[int]
        :rtype: bool
        """
        l1,b1,r1,t1=rec1
        l2,b2,r2,t2=rec2
        return not (r2<=l1 or l2>=r1 or b2>=t1 or t2<=b1)

c++代码：

class Solution {
public:
    bool isRectangleOverlap(vector<int>& rec1, vector<int>& rec2) {
        int l1=rec1[0],b1=rec1[1],r1=rec1[2],t1=rec1[3];
        int l2=rec2[0],b2=rec2[1],r2=rec2[2],t2=rec2[3];
        return !(l2>=r1||r2<=l1||b2>=t1||t2<=b1);
    }
};

总结：
有时候问你相交吗，从不相交的角度看反而更好计算。