[LeetCode 223] Rectangle Area

最新推荐文章于 2020-09-13 00:05:52 发布

Mavs

最新推荐文章于 2020-09-13 00:05:52 发布

阅读量3.1k

点赞数

CC 4.0 BY-SA版权

分类专栏： Leetcode Java LeetCode Questions 文章标签： leetcode math

本文链接：https://blog.youkuaiyun.com/sbitswc/article/details/48702961

Leetcode 同时被 3 个专栏收录

287 篇文章

订阅专栏

LeetCode Questions

178 篇文章

订阅专栏

Java

106 篇文章

订阅专栏

本文介绍了一种计算二维平面上两个矩形重叠部分面积的方法，并提供了一个具体的Java实现示例。通过数学计算得到两个矩形总面积，然后减去它们之间的重叠面积。

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

solution:

Math, get total area of two rectangle, minus overlap area.

public int computeArea(int A, int B, int C, int D, int E, int F, int G, int H) {
        int blx = Math.max(A, E);
        int bly = Math.max(B, F);
        int rtx = Math.min(C, G);
        int rty = Math.min(D, H);
        int res = (C-A) * (D-B) + (G-E) * (H-F);
        if(blx >= rtx || bly >= rty) return res;
        return res - (rtx - blx) * (rty - bly);
    }