leetcode--Rectangle Area

最新推荐文章于 2021-10-06 01:09:08 发布

原创最新推荐文章于 2021-10-06 01:09:08 发布 · 690 阅读

0 ·

CC 4.0 BY-SA版权

leetcode 专栏收录该内容

177 篇文章

订阅专栏

本文介绍了一个计算二维平面上两个矩形总面积的算法，通过输入每个矩形的底左角和顶右角坐标，输出总面积，考虑相交部分避免重复计算。

摘要生成于 C知道，由 DeepSeek-R1 满血版支持，前往体验 >

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) {
        return (C - A) * (D - B) + (G - E) * (H - F) - 
                     Math.max(0, Math.min(C, G) - Math.max(A, E)) * Math.max(0, Math.min(D, H) - Math.max(B, F));
    }
}