Leetcode: Rectangle Area

最新推荐文章于 2022-07-24 22:16:02 发布

weixin_30764771

最新推荐文章于 2022-07-24 22:16:02 发布

阅读量56

点赞数

CC 4.0 BY-SA版权

原文链接：http://www.cnblogs.com/EdwardLiu/p/5055848.html

本文介绍了一种计算二维平面上两个矩形重叠部分面积的方法，并提供了一个Java类的实现示例。该方法首先计算两个矩形各自的面积，然后判断它们是否相交，最后计算并返回两个矩形总面积减去重叠部分的面积。

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.

Rectangle Area
Assume that the total area is never beyond the maximum possible value of int.

Rectangle Area

 1 public class Solution {
 2     public int computeArea(int A, int B, int C, int D, int E, int F, int G, int H) {
 3         int area3 = 0;
 4         int area1 = (C-A) * (D-B);
 5         int area2 = (G-E) * (H-F);
 6         if (C<=E || G<=A || H<=B || D<=F) area3 = 0;
 7         else area3 = (Math.min(C,G)-Math.max(A,E)) * (Math.min(D,H)-Math.max(B,F));
 8         return area1 + area2 - area3;
 9     }
10 }