LeetCode 223. Rectangle Area

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

思路：显然总覆盖面积等于两矩形面积减去重合部分面积。设两矩阵R1，R2，重合部分某点P(x,y)，它必在R1内部，则A <= x <= C，B <= y <= D；必在R2内部，则E <= x <= G，F <= y <= H。综上，max(A, E) <= x <= min(C, G)，max(B, F) <= y <= min(D, H)，满足这两个条件的点就是重合部分。如果无法满足，即max(A, E) > min(C, G)或max(B,F) > min(D,H)，那就没有重合部分。
Obviously the total area covered is equal to the area of two rectangles minus the area of the overlapping part. Let two rectangles be R1, R1, and let the point P inside the overlapping part have coordinates (x, y). P must be inside R1, so A <= x <= C，B <= y <= D. P must be inside R2, so E <= x <= G，F <= y <= H. To sum up, max(A, E) <= x <= min(C, G)，max(B, F) <= y <= min(D, H), and the point meeting these two conditions is inside the overlapping part. If max(A, E) > min(C, G) or max(B,F) > min(D,H), there is no overlapping part.

class Solution {
public:
    int computeArea(int A, int B, int C, int D, int E, int F, int G, int H) {
        int s1 = (C-A)*(D-B), s2 = (G-E)*(H-F); // 先不相加，可能会溢出，如输入(0,0)(40000,50000)(0,0)(40000,50000)
        int left = max(A,E), right = min(C,G);
        int bottom = max(B,F), top = min(D,H);
        if(left < right && bottom < top)
            return s1 - (right-left)*(top-bottom) + s2;
        return s1 + s2;
    }
};