[LeetCode]60. 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.

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

class Solution {
public:
    int computeArea(int A, int B, int C, int D, int E, int F, int G, int H) {
        int res = (C - A) * (D - B) + (G - E) * (H - F);
        if (!(A >= G || B >= H || E >= C || F >= D))
            res -= (min(G, C) - max(E, A)) * (min(H, D) - max(F, B));
        return res;
    }
};

[LeetCode]60. Rectangle Area矩形面积

原文：http://www.cnblogs.com/aprilcheny/p/4943044.html