[LeetCode 223] Rectangle Area

Find the total area covered by two rectilinear rectangles in a2D 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.

solution:

Math, get total area of two rectangle, minus overlap area.

public int computeArea(int A, int B, int C, int D, int E, int F, int G, int H) {int blx = Math.max(A, E);int bly = Math.max(B, F);int rtx = Math.min(C, G);int rty = Math.min(D, H);int res = (C-A) * (D-B) + (G-E) * (H-F);if(blx >= rtx || bly >= rty) return res;return res – (rtx – blx) * (rty – bly);}

版权声明：本文为博主原创文章，，未经博主允许不得转载。

真凉爽啊！青山绿水映入我的眼中，景色怡人啊！