leetcode之 Rectangle Area

最新推荐文章于 2019-12-17 20:06:59 发布

原创最新推荐文章于 2019-12-17 20:06:59 发布 · 238 阅读

0 ·

CC 4.0 BY-SA版权

文章标签：

#leetcode #面试 #算法

算法专栏收录该内容

60 篇文章

订阅专栏

本文介绍了一种算法来计算二维平面上两个矩形的总面积，包括如何判断是否有重叠区域并计算总面积。

摘要生成于 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 min(int a,int b)
    {
        return a < b ? a : b;
    }
    int max(int a,int b)
    {
        return a < b ? b : a;
    }
    int computeArea(int A, int B, int C, int D, int E, int F, int G, int H) {
        if(C <= E || G <= A || B >= H || F >= D)
            return (C - A) * (D - B) + (G - E) * (H - F);
        int leftX = max(A,E);
        int leftY = max(B,F);
        int rightX = min(C,G);
        int rightY = min(D,H);
        return (C - A) * (D - B) + (G - E) * (H - F) - (rightX - leftX) * (rightY - leftY);
    }
};