首页 > 其他 > 详细

leetCode(33):Rectangle Area

时间:2015-07-08 09:32:44      阅读:258      评论: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.


class Solution {
public:
    int computeArea(int A, int B, int C, int D, int E, int F, int G, int H) {
        int area1=(C-A)*(D-B);
    	int area2=(G-E)*(H-F);
    	if(B>=H || F>=D || E>=C || G<=A)
    	{//如果不相交
    		return area1+area2;
    	}
    	else
    	{
    		int length,width;
    		width=min(C,G)-max(A,E);//宽
    		length=min(D,H)-max(B,F);//长
    		return area1+area2-length*width;//面积之和减去重合部分面积		
    	}
    }
};


版权声明:本文为博主原创文章,未经博主允许不得转载。

leetCode(33):Rectangle Area

原文:http://blog.csdn.net/walker19900515/article/details/46798639

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