223. Rectangle Area

最新推荐文章于 2025-09-12 17:31:31 发布

转载最新推荐文章于 2025-09-12 17:31:31 发布 · 95 阅读

0 ·

CC 4.0 BY-SA版权

原文链接：http://www.cnblogs.com/panini/p/7213976.html

文章标签：

#数据结构与算法

本文介绍了一种计算两个直角矩形在二维平面上所覆盖总面积的方法。通过判断两个矩形是否存在重叠区域，并根据不同的情况计算总面积。提供了一个简洁的Java代码实现。

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.

链接： http://leetcode.com/problems/rectangle-area/

7/20/2017

一开始看错题目了，以为求overlap部分的面积。其实需要球所有面积

要先计算是否有重叠，再来按照公式算重叠部分面积，否则没有重叠的话会有错。

 1 public class Solution {
 2     public int computeArea(int A, int B, int C, int D, int E, int F, int G, int H) {
 3         int overlap = 0;
 4         if (C < E || G < A || D < F || H < B) {
 5             overlap = 0;
 6         } else {
 7             overlap = (Math.min(C, G) - Math.max(A, E)) * (Math.min(D, H) - Math.max(B, F));
 8         }
 9         return (C - A) * (D - B) + (G - E) * (H - F) - overlap;
10     }
11 }