标签：style top http val else fine span 计算 border
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 area = (C - A) * (D - B) + (G - E) * (H - F); if (B > H || F > D || A > G || C < E) return area; int x1 = Math.max(A, E); int y1 = Math.max(B, F); int x2 = Math.min(C, G); int y2 = Math.min(D, H); int result = (x2 - x1) * (y2 - y1); if (result > 0){ return area - result; } else { return area + result; } } }
leetcode 223. Rectangle Area 计算面积---------- java
标签：style top http val else fine span 计算 border
原文地址：http://www.cnblogs.com/xiaoba1203/p/6900195.html
