[leetcode]223. Rectangle Area

最新推荐文章于 2019-04-19 11:56:53 发布

xiaocong1990

最新推荐文章于 2019-04-19 11:56:53 发布

阅读量304

点赞数

CC 4.0 BY-SA版权

分类专栏： leetcode

本文链接：https://blog.youkuaiyun.com/xiaocong1990/article/details/53121486

leetcode 专栏收录该内容

473 篇文章

订阅专栏

本文介绍了一个计算两个矩形在二维平面上覆盖总面积的算法。通过确定每个矩形的边界，计算出各自的面积，并找出重叠部分的尺寸来计算重叠区域的面积。最终返回两矩形面积之和减去重叠面积。

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

题目链接:https://leetcode.com/problems/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 area1;
        int area2;
        int lap;
        if(C>A && D>B)
            area1=(C-A)*(D-B);
        else
            area1=0;
        
        if(G>E && H>F)
            area2=(G-E)*(H-F);
        else
            area2=0;
        int innerLeft=A>E?A:E;
        int innerRight=G>C?C:G;
        int innerUp=D>H?H:D;
        int innerBottom=B>F?B:F;
        int lengthLap=(innerRight>innerLeft)?(innerRight-innerLeft):0;
        int widthLap=(innerUp>innerBottom)?(innerUp-innerBottom):0;
        lap=lengthLap*widthLap;
        return area1+area2-lap;
    }

};