[leetCode/JS] 223. Rectangle Area

문제 설명

Given the coordinates of two rectilinear rectangles in a 2D plane, return the total area covered by the two rectangles.

The first rectangle is defined by its bottom-left corner (ax1, ay1) and its top-right corner (ax2, ay2).

The second rectangle is defined by its bottom-left corner (bx1, by1) and its top-right corner (bx2, by2).

 

입출력 예

Example 1:

Input: ax1 = -3, ay1 = 0, ax2 = 3, ay2 = 4, bx1 = 0, by1 = -1, bx2 = 9, by2 = 2
Output: 45

Example 2:

Input: ax1 = -2, ay1 = -2, ax2 = 2, ay2 = 2, bx1 = -2, by1 = -2, bx2 = 2, by2 = 2
Output: 16

Constraints

• -104 <= ax1 <= ax2 <= 104
• -104 <= ay1 <= ay2 <= 104
• -104 <= bx1 <= bx2 <= 104
• -104 <= by1 <= by2 <= 104

---

내 솔루션

• 겹치는 부분을 어떻게 알아낼까~ 하다가 찾아냄.
• 나머진 그냥 넓이 구하고 겹치는 부분만 빼주면됨!

var computeArea = function(ax1, ay1, ax2, ay2, bx1, by1, bx2, by2) {
  let width = Math.min(ax2, bx2) - Math.max(ax1, bx1);
  let height = Math.min(ay2, by2) - Math.max(ay1, by1);

  width = width > 0 ? width : 0;
  height = height > 0 ? height : 0;

  return ((ax2 - ax1) * (ay2 - ay1) + (bx2 - bx1) * (by2 - by1)) - width * height;
};

감상평

• 재미이따!!