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.
![Rectangle Area](https://leetcode.com/static/images/problemset/rectangle_area.png)
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 area = (C-A)*(D-B) + (G-E)*(H-F);
long overload = Math.max(0, ((long)Math.min(C,G)-(long)Math.max(A,E)) ) * Math.max(0, (long)Math.min(D,H)-(long)Math.max(B,F) );
return area-(int)overload;
}
}