leetcode 223. Rectangle Area

最新推荐文章于 2023-07-19 10:36:57 发布

a1025461748

最新推荐文章于 2023-07-19 10:36:57 发布

阅读量264

点赞数

CC 4.0 BY-SA版权

分类专栏： Leetcode练习

本文链接：https://blog.youkuaiyun.com/a1025461748/article/details/75212366

Leetcode练习专栏收录该内容

294 篇文章

订阅专栏

本文介绍了一种计算两个直角矩形在二维平面上所覆盖总面积的方法。每个矩形由其左下角和右上角定义。通过确定两个矩形的重叠部分，可以准确计算出总面积。

摘要生成于 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) {
        int area1 = (C-A)*(D-B);
        int area2 = (G-E)*(H-F);
        int left = Math.max(A, E), right = Math.max(Math.min(C, G), left);
        int bottom = Math.max(B, F), upper = Math.max(Math.min(D, H), bottom);
        return area1+area2-(right-left)*(upper-bottom);
    }
}