LeetCode #223 - Rectangle Area

最新推荐文章于 2021-11-18 05:50:22 发布

原创最新推荐文章于 2021-11-18 05:50:22 发布 · 205 阅读

0 ·

CC 4.0 BY-SA版权

LeetCode 专栏收录该内容

625 篇文章

订阅专栏

本文介绍了一种计算二维平面上两个矩形重叠覆盖面积的方法。通过计算两个矩形的总面积并减去重叠部分的面积来得到结果。提供了具体的算法实现，适用于计算机图形学和游戏开发等领域。

题目描述：

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.

Rectangle Area

Example:

Input: A = -3, B = 0, C = 3, D = 4, E = 0, F = -1, G = 9, H = 2
Output: 45

Note:

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 sum=(C-A)*(D-B)+(G-E)*(H-F);
        if(A>=G||C<=E||D<=F||B>=H) return sum;
        else return sum-(min(C,G)-max(A,E))*(min(D,H)-max(B,F));
    }
};