首页 > 其他 > 详细

[leetcode] Rectangle Area

时间:2015-06-09 19:03:02      阅读:132      评论:0      收藏:0      [点我收藏+]

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;
  }
};

 

[leetcode] Rectangle Area

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

(0)
(0)
   
举报
评论 一句话评论(0
关于我们 - 联系我们 - 留言反馈 - 联系我们:wmxa8@hotmail.com
© 2014 bubuko.com 版权所有
打开技术之扣,分享程序人生!