【leetcode】223. Rectangle Area

最新推荐文章于 2021-10-06 01:09:08 发布

ghscarecrow

最新推荐文章于 2021-10-06 01:09:08 发布

阅读量182

点赞数

CC 4.0 BY-SA版权

本文链接：https://blog.youkuaiyun.com/ghscarecrow/article/details/86651266

解题报告同时被 2 个专栏收录

203 篇文章

订阅专栏

leetcode题解大全

115 篇文章

订阅专栏

本文介绍了一种计算二维平面上两个矩形覆盖总面积的方法。通过定义矩形的左下角和右上角坐标，算法能准确计算出两矩形重叠区域，并给出总面积。示例输入为A=-3,B=0,C=3,D=4,E=0,F=-1,G=9,H=2，输出为45。

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

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 left = Math.max(A,E);
        int right = Math.max(left,Math.min(C,G));
        int bottom = Math.max(B,F);
        int up = Math.max(bottom,Math.min(D,H));
        return (C - A) * (D - B) + (G - E) * (H - F) - (right - left) * (up - bottom);
    }
}