leetcode 223. Rectangle Area

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

原创最新推荐文章于 2023-07-19 10:36:57 发布 · 192 阅读

0 ·

CC 4.0 BY-SA版权

leetcode 专栏收录该内容

280 篇文章

订阅专栏

本文介绍了一种计算二维平面上两个矩形覆盖总面积的方法。通过定义每个矩形的左下角和右上角坐标，算法能够准确计算出两个矩形重叠部分的面积，并给出最终总面积。

223. Rectangle Area

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.

class Solution {
public:
    int computeArea(int A, int B, int C, int D, int E, int F, int G, int H)
    {
        int bl_x = max(A,E);
        int bl_y = max(B,F);
        int tr_x = min(C,G);
        int tr_y = min(D,H);
        
        int area_A = (C-A) * (D-B);
        int area_B = (G-E) * (H-F);
        
        int CopyArea = 0;
        if (E >= C || F >= D || G <= A || H <= B)
            return area_A + area_B - CopyArea;
        
        CopyArea = (tr_x - bl_x) * (tr_y - bl_y);
        return area_A + area_B - CopyArea;
    }
};