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.
Round 3:
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
{
int dup = std::abs((std::min(C, G) - std::max(A, E)) * (std::min(D, H) - std::max(B, F)));
return (C-A) * (D-B) + (G-E)*(H-F) - dup;
}
}
};