Skip to content

Latest commit

 

History

History
31 lines (25 loc) · 1.46 KB

풀이_LC836.md

File metadata and controls

31 lines (25 loc) · 1.46 KB
Raw

〽️ 836. Rectangle Overlap

  • Date : 2021.12.12(일)
  • Time : 10분

Problem

  • An axis-aligned rectangle is represented as a list [x1, y1, x2, y2], where (x1, y1) is the coordinate of its bottom-left corner, and (x2, y2) is the coordinate of its top-right corner. Its top and bottom edges are parallel to the X-axis, and its left and right edges are parallel to the Y-axis.
  • 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 rec1 and rec2, return true if they overlap, otherwise return false.

Constraints

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

Example

  • rect1.length == 4
  • rect2.length == 4
  • -10^9 <= rec1[i], rec2[i] <= 10^9
  • rec1 and rec2 represent a valid rectangle with a non-zero area.

풀이

    def isRectangleOverlap(self, rec1: List[int], rec2: List[int]) -> bool:
        x = min(rec1[2], rec2[2]) - max(rec1[0], rec2[0])
        y = min(rec1[3], rec2[3]) - max(rec1[1], rec2[1])
        return x > 0 and y > 0

: 이 문제는 두개의 사각형이 겹치는냐 겹치지 않느냐를 판별하는 문제이다. 각 축마다 겹치는지 아닌지를 판단해주었다. [2]는 maxX를 의미하고 [0]은 minX를 의미한다. 또한 [3]은 maxY, [1]은 minY를 의미한다. 이들을 서로 빼서 그게 0보다 크다면 겹친다는 의미이다.