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.
class Solution {
public:
int computeArea(int A, int B, int C, int D, int E, int F, int G, int H) {
int area1=(C-A)*(D-B);
int area2=(G-E)*(H-F);
if(B>=H || F>=D || E>=C || G<=A)
{//如果不相交
return area1+area2;
}
else
{
int length,width;
width=min(C,G)-max(A,E);//宽
length=min(D,H)-max(B,F);//长
return area1+area2-length*width;//面积之和减去重合部分面积
}
}
};