[leetcode] Rectangle Area

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

weixin_30547797

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

阅读量56

点赞数

CC 4.0 BY-SA版权

原文链接：http://www.cnblogs.com/lxd2502/p/4563911.html

本文介绍了一种计算二维平面上两个矩形覆盖总面积的方法。通过计算两个矩形的面积及它们相交部分的面积来得出结果。适用于计算机图形学、算法设计等领域。

Rectangle Area

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.

Credits:
Special thanks to @mithmatt for adding this problem, creating the above image and all test cases

求矩形覆盖面积。因为只有两个矩形，所以直接算结果 = 两个矩形的面积 - 相交的面积。

class Solution
{
public:
  int computeArea(int A, int B, int C, int D, int E, int F, int G, int H)
  {
    int x1 = A > E ? A : E;
    int y1 = B > F ? B : F;
    int x2 = C > G ? G : C;
    int y2 = D > H ? H : D;

    int x = x2 - x1, y = y2 - y1;
    int s = 0;
    if(x>0 && y>0)
      s = x * y;

    return (C-A)*(D-B)+(G-E)*(H-F) - s;
  }
};