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.
代码:
public class Solution {
public int computeArea(int A, int B, int C, int D, int E, int F, int G, int H) {
//判断是否相交
if(C<E||A>G||B>H||D<F){
//若不相交,则返回两个矩形的面积之和
return (C-A)*(D-B)+(G-E)*(H-F);
}
else{
//若相交,则两个矩形的面积之和减去相交部分面积
return (C-A)*(D-B)+(G-E)*(H-F)-(Math.min(C,G)-Math.max(A,E))*(Math.min(D,H)-Math.max(B,F));
}
}
}