LeetCode #836 Rectangle Overlap

Posted on | Post modified | In , ,

Problem

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.

Examples

1
2
Input: rec1 = [0,0,2,2], rec2 = [1,1,3,3]
Output: true
1
2
Input: rec1 = [0,0,1,1], rec2 = [1,0,2,1]
Output: false

Solution

1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
class Solution:
    def isRectangleOverlap(self, rec1, rec2):
        """
        :type rec1: List[int]
        :type rec2: List[int]
        :rtype: bool
        """
#         def get_info(rec):
#             rec_left = tuple(rec[:2])
#             rec_width = rec[2] - rec[0]
#             rec_height = rec[3] - rec[1]
            
#             return {'pt':rec_left, 'w':rec_width, 'h':rec_height}
        w1 = rec1[2] - rec1[0]
        w2 = rec2[2] - rec2[0]
        h1 = rec1[3] - rec1[1]
        h2 = rec2[3] - rec2[1]
        
        if (rec1[0] + w1 <= rec2[0]) or \
           (rec2[0] + w2 <= rec1[0]) or \
           (rec1[1] + h1 <= rec2[1]) or \
           (rec2[1] + h2 <= rec1[1]):
            return False
        else:
            return True

or just

1
2
3
4
5
6
7
8
9
10
11
class Solution:
    def isRectangleOverlap(self, rec1, rec2):
        """
        :type rec1: List[int]
        :type rec2: List[int]
        :rtype: bool
        """
        return not( (rec1[2] <= rec2[0]) or \
                    (rec2[2] <= rec1[0]) or \
                    (rec1[3] <= rec2[1]) or \
                    (rec2[3] <= rec1[1]))