题目链接：https://leetcode.com/problems/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.
思路：
小学好像做过这种题=- = easy
算法：
-
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) + (H - F) * (G - E);
-
if (E >= C || G <= A || H <= B || F >= D) {
-
return area;
-
}
-
int left_h = Math.max(E, A);
-
int left_v = Math.max(F, B);
-
int right_h = Math.min(C, G);
-
int right_v = Math.min(D, H);
-
return area - (right_h - left_h) * (right_v - left_v);
-
}
【Leetcode】Rectangle Area
原文：http://blog.csdn.net/yeqiuzs/article/details/51598084
