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.
1 class Solution { 2 public: 3 int computeArea(int A, int B, int C, int D, int E, int F, int G, int H) { 4 int area = (C-A)*(D-B)+(G-E)*(H-F); 5 if(A>=G||B>=H||C<=E||D<=F) 6 return area; 7 int top=min(D,H); 8 int bottom=max(B,F); 9 int left=max(A,E); 10 int right=min(C,G); 11 int overlap=(top-bottom)*(right-left); 12 return area-overlap; 13 } 14 };