223. Rectangle Area

Find the total area covered by two rectilinear rectangles in a 2D plane.

Each rectangle is defined by its bottom left corner and top right corner as shown in the figure.

Assume that the total area is never beyond the maximum possible value of int.

 連接： http://leetcode.com/problems/rectangle-area/

7/20/2017

一開始看錯題目了，覺得求overlap部分的面積。其實須要球全部面積

要先計算是否有重疊，再來按照公式算重疊部分面積，不然沒有重疊的話會有錯。

 1 public class Solution {
 2     public int computeArea(int A, int B, int C, int D, int E, int F, int G, int H) {
 3         int overlap = 0;
 4         if (C < E || G < A || D < F || H < B) {
 5             overlap = 0;
 6         } else {
 7             overlap = (Math.min(C, G) - Math.max(A, E)) * (Math.min(D, H) - Math.max(B, F));
 8         }
 9         return (C - A) * (D - B) + (G - E) * (H - F) - overlap;
10     }
11 }

別人的算法

https://discuss.leetcode.com/topic/17705/just-another-short-way

更多討論

https://discuss.leetcode.com/category/231/rectangle-area