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.
计算两个长方形的总面积。
首先判断两个长方形是否有重合部分,没有重合的话,就将两个长方形的面积相加就行,否则的话,计算出重合的面积,就可以得到total area。
如果两个长方形有相交的部分,那么相交部分的左下和右上两点的坐标X(max(A, E), max(B, F)),Y(min(C, G), min(D, H)),这个不是特别容易发现,当做常识比较好。
int computeArea(int A, int B, int C, int D, int E, int F, int G, int H)
{
int area_A = (C - A) * (D - B);
int area_B = (H - F) * (G - E);
if(C <= E || G <= A || B >= H || F >= D)return area_A + area_B;
int newA = A > E ? A : E;
int newB = B > F ? B : F;
int newC = C < G ? C : G;
int newD = D < H ? D : H;
return area_A - (newC - newA) * (newD - newB) + area_B;
}