leetcode 223: Rectangle Area

Rectangle Area

Find 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.

[思路]

求出两个区域的面积, 然后减去overlapping的区域, 即为所求.

[CODE]

public 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 223: Rectangle Area所遇到的程序开发问题。

如果觉得靠谱客网站的内容还不错，欢迎将靠谱客网站推荐给程序员好友。