Rectangle Area
Total Accepted: 2205 Total Submissions: 8138Find the total area covered by two rectilinear rectangles in a2D 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.
[思路]
求出两个区域的面积, 然后减去overlapping的区域, 即为所求.
[CODE]
复制代码
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18public class Solution { public int computeArea(int A, int B, int C, int D, int E, int F, int G, int H) { int area1 = (C-A) * (D-B); int area2 = (G-E) * (H-F); int overlapRegion = overlap(A, B, C, D, E, F, G, H); return area1 + area2 - overlapRegion; } private int overlap(int A, int B, int C, int D, int E, int F, int G, int H) { int h1 = Math.max(A, E); int h2 = Math.min(C, G); int h = h2 - h1; int v1 = Math.max(B, F); int v2 = Math.min(D, H); int v = v2 - v1; if(h<=0 || v<=0) return 0; else return h*v; } }
最后
以上就是聪慧自行车最近收集整理的关于leetcode 223: Rectangle Area的全部内容,更多相关leetcode内容请搜索靠谱客的其他文章。
本图文内容来源于网友提供,作为学习参考使用,或来自网络收集整理,版权属于原作者所有。
发表评论 取消回复