[LeetCode] 836. Rectangle Overlap_Easy
2018-08-17 06:01 Johnson_强生仔仔 阅读(211) 评论(0) 编辑 收藏 举报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
andrec2
are lists of 4 integers. - All coordinates in rectangles will be between
-10^9
and10^9
.
这个题目用逆向思维, 去想怎么样不overlap, 所以rec1可以在left, right, up, down 四个方向.
Code
class Solution(object): def isRectangleOverlap(self, rec1, rec2): """ :type rec1: List[int] :type rec2: List[int] :rtype: bool """ ##Solution1 return not (rec1[3] <= rec2[1] or #left rec1[1] >= rec2[3] or # right rec1[0] >= rec2[2] or #up rec1[2] <= rec2[0]) #down