原文地址:http://www.cnblogs.com/easonliu/p/4560596.html
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.
这道题我用的是if和else判断各种情况,结果总是漏掉某种情况。实在受不了了直接搜答案,发现原来这么简单,思路一开始就没对。
class Solution {
public:
int computeArea(int A, int B, int C, int D, int E, int F, int G, int H) {
int res = (D - B) * (C - A) + (H - F) * (G - E);
int A1 = max(A, E), B1 = max(B, F), C1 = min(C, G), D1 = min(D, H);
if (D1 <= B1 || C1 <= A1) return res;
return res - (D1 - B1) * (C1 - A1);
}
};