LeetCode：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.

Credits:
Special thanks to @mithmatt for adding this problem, creating the above image and all test cases.

Subscribe to see which companies asked this question

思路：

数学题，求矩形覆盖面积。因为只有两个矩形，所以直接算结果 = 两个矩形的面积 - 相交的面积。

代码：

class Solution {public:    int computeArea(int A, int B, int C, int D, int E, int F, int G, int H)     {           int area = (D - B) * (C - A) + (G - E) * (H - F);        int I = max(A, E),J = max(B,F),K = min(C,G),L = min(D,H);        if(L <= J || K <= I) return area;        return area - (L - J)*(K - I);        }};