zoukankan      html  css  js  c++  java
  • leetcode 836. Rectangle Overlap

    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:

    1. Both rectangles rec1 and rec2 are lists of 4 integers.
    2. All coordinates in rectangles will be between -10^9 and 10^9.

    解法1:

    class Solution(object):
        def isRectangleOverlap(self, rec1, rec2):
            """
            :type rec1: List[int]
            :type rec2: List[int]
            :rtype: bool
            """
            return not (rec1[1] >= rec2[3] # higher
                    or rec1[3] <= rec2[1] # lower
                    or rec1[2] <= rec2[0] # lefter
                    or rec1[0] >= rec2[2]) # righter
    

    解法2:

    class Solution:
        def isRectangleOverlap(self, rec1, rec2):
            """
            :type rec1: List[int]
            :type rec2: List[int]
            :rtype: bool
            """
            x_overlap = min(rec1[2], rec2[2]) - max(rec1[0], rec2[0])
            y_overlap = min(rec1[3], rec2[3]) - max(rec1[1], rec2[1])
            return x_overlap > 0 and y_overlap > 0
    
  • 相关阅读:
    words you learn through youtube and so on in daily life
    python 随笔
    Zookeeper 指南
    Mac 后台服务
    Elasticsearch 指南
    架构之灰度部署
    架构之CDN缓存
    架构之微服务(zookeeper)
    架构之微服务(etcd)
    架构之微服务设计(Nginx + Upsync)
  • 原文地址:https://www.cnblogs.com/bonelee/p/9226626.html
Copyright © 2011-2022 走看看