Rectangle Area

码农少年

于 2015-12-11 15:34:48 发布

阅读量248

点赞数

CC 4.0 BY-SA版权

分类专栏： c++ LeetCode之旅

本文链接：https://blog.youkuaiyun.com/wangbao2111/article/details/50264503

LeetCode之旅同时被 2 个专栏收录

65 篇文章

订阅专栏

c++

29 篇文章

订阅专栏

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

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

class Solution {
public:
    int computeArea(int A, int B, int C, int D, int E, int F, int G, int H) {
        int result = (C-A)*(D-B) + (G-E)*(H-F); 
        int A1 = max(A,E);
        int B1 = max(B,F);
        int C1 = min(C,G);
        int D1 = min(D,H);
        if(C1<=A1 || D1<=B1)
            return result;
        else
            return result - (C1-A1)*(D1-B1);
    }
};