标签：

题目：

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

【LeetCode】223. Rectangle Area

标签：

原文地址：http://www.cnblogs.com/jdneo/p/4803288.html