[LeetCode]223. Rectangle Area

最新推荐文章于 2026-01-03 03:21:30 发布

转载最新推荐文章于 2026-01-03 03:21:30 发布 · 319 阅读

文章标签：

#leetcode

leetcode 专栏收录该内容

64 篇文章

订阅专栏

本文介绍了一种计算两个矩形在二维平面上所覆盖总面积的方法。通过定义每个矩形的底左角和顶右角坐标，实现了考虑重叠情况下的总面积计算。如果矩形不重叠，则总面积为两矩形面积之和；若存在重叠部分，则从总面积中减去该部分。

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

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||E>=C)
             return area;
         else{
             int m = (D>H?H:D)-(B>F?B:F);
             int n = (C>G?G:C)-(A>E?A:E);
             return area - m*n;
         }
}