LeetCode：Rectangle Area

最新推荐文章于 2025-08-22 12:09:46 发布

fullstack_lth

最新推荐文章于 2025-08-22 12:09:46 发布

阅读量359

点赞数

CC 4.0 BY-SA版权

分类专栏： LeetCode 文章标签： c++ leetcode

本文链接：https://blog.youkuaiyun.com/u014744118/article/details/49592115

LeetCode 专栏收录该内容

161 篇文章

订阅专栏

本文介绍了一种计算二维平面上两个矩形覆盖总面积的方法。通过计算两个矩形的面积之和减去它们相交部分的面积来得出最终结果。提供了一个C++实现示例。

摘要生成于 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.

Credits:
Special thanks to @mithmatt for adding this problem, creating the above image and all test cases.

Subscribe to see which companies asked this question

思路：

数学题，求矩形覆盖面积。因为只有两个矩形，所以直接算结果 = 两个矩形的面积 - 相交的面积。

代码：

class Solution {
public:
    int computeArea(int A, int B, int C, int D, int E, int F, int G, int H) 
    {   
        int area = (D - B) * (C - A) + (G - E) * (H - F);
        int I = max(A, E),J = max(B,F),K = min(C,G),L = min(D,H);
        if(L <= J || K <= I) return area;
        return area - (L - J)*(K - I);    
    }
};