关闭

leetCode(33):Rectangle Area

标签: leetcode
377人阅读 评论(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.

Rectangle Area

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;//面积之和减去重合部分面积		
    	}
    }
};


0
0

查看评论
* 以上用户言论只代表其个人观点,不代表CSDN网站的观点或立场
    个人资料
    • 访问:98732次
    • 积分:2496
    • 等级:
    • 排名:第14787名
    • 原创:143篇
    • 转载:53篇
    • 译文:1篇
    • 评论:13条
    博客专栏