[leetcode] 223. Rectangle Area 解题报告

题目链接：https://leetcode.com/problems/rectangle-area/

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.



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 area = (C-A)*(D-B) + (G-E)*(H-F);
if(!(B >= H || F>=D || A >=G ||E>=C))
{
int tem = (min(C, G) -max(A, E)) * (min(D, H) -max(B, F));
area -= tem;
}
return area;
}
};