首页 > 其他 > 详细

223. Rectangle Area

时间:2016-08-01 22:38:50      阅读:324      评论:0      收藏:0      [点我收藏+]

题目:

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.

答案:

没什么好说的,两个矩形相加,如果有重合部分则减去重合部分的面积

 

 1 class Solution {
 2 public:
 3     int computeArea(int A, int B, int C, int D, int E, int F, int G, int H) {
 4         int sum;
 5         sum=(C-A)*(D-B)+(G-E)*(H-F);
 6         if(E>=C||F>=D||B>=H||A>=G){
 7             return sum;
 8         }
 9         else{
10             int overlap;
11             overlap=(min(C,G)-max(E,A))*(min(D,H)-max(B,F));
12             return (sum-overlap);
13         }
14     }
15 };

 

223. Rectangle Area

原文:http://www.cnblogs.com/Reindeer/p/5727375.html

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