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) {
int left=Math.max(A,E);
int bottom=Math.max(B,F);
int right=Math.min(C,G);
int top=Math.min(D,H);
int area=(C-A)*(D-B)+(G-E)*(H-F);
if(right>left&&top>bottom)
{
area-=(right-left)*(top-bottom);
}
return area;
}
}
转载请注明原文地址: https://ju.6miu.com/read-1301238.html