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.
求两个矩形在二维平面的覆盖面积。
每个矩形给出左下角和右上角。
假设覆盖面积没有超过int型最大值。
两个矩形就先求出他们的重叠面积,再用总面积减去重叠面积就好了,代码如下:
class Solution {
public:
int computeArea(int A, int B, int C, int D, int E, int F, int G, int H) {
int S=(C-A)*(D-B)+(G-E)*(H-F);
int x1=max(A,E),y1=min(D,H),x2=min(C,G),y2=max(F,B);
if(x1>x2||y2>y1) return S;
return S-(x2-x1)*(y1-y2);
}
};