leetcode 223. Rectangle Area

最新推荐文章于 2021-08-26 00:26:39 发布

原创最新推荐文章于 2021-08-26 00:26:39 发布 · 478 阅读

0 ·

CC 4.0 BY-SA版权

文章标签：

#leetcode

Leetcode 专栏收录该内容

48 篇文章

订阅专栏

本文介绍了一种计算二维平面上两个矩形覆盖总面积的方法。通过定义矩形的左下角和右上角坐标，利用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.
这里写图片描述
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 area1=(C-A)*(D-B);
       int area2=(G-E)*(H-F);

       int overlaparea=overlap(A,B,C,D,E,F,G,H);

       return area1+area2-overlaparea;

    }


    public 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(h1>h2 ||v1>v2)
           return 0;
       else
           return h*v;                  
     }
}