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.
class Solution {
public:
int computeArea(int A, int B, int C, int D, int E, int F, int G, int H) {
int result = (C-A)*(D-B) + (G-E)*(H-F);
int A1 = max(A,E);
int B1 = max(B,F);
int C1 = min(C,G);
int D1 = min(D,H);
if(C1<=A1 || D1<=B1)
return result;
else
return result - (C1-A1)*(D1-B1);
}
};