标签：
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.
解题思路：
这道题的问题就一个，如何判断两个矩形是否重叠。知道后，总面积就是两个矩形的面积和减去重叠的面积就可以了。
结论出来就很简单，直接看代码吧。
public class Solution { public int computeArea(int A, int B, int C, int D, int E, int F, int G, int H) { int areaA = (C - A) * (D - B); int areaB = (G - E) * (H - F); int left = Math.max(A, E); int bottom = Math.max(B, F); int right = Math.min(C, G); int top = Math.min(D, H); int overlap = 0; if(top > bottom && right > left) { overlap = (top - bottom) * (right - left); } return areaA + areaB - overlap; } }
标签：
原文地址：http://www.cnblogs.com/NickyYe/p/4601119.html
