佛曰不可说

路漫漫其修远兮,吾将上下而求索

leetCode(33):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.

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


阅读更多
文章标签: leetcode
个人分类: leetCode
所属专栏: LeetCode
想对作者说点什么? 我来说一句

没有更多推荐了,返回首页

不良信息举报

leetCode(33):Rectangle Area

最多只允许输入30个字

加入CSDN,享受更精准的内容推荐,与500万程序员共同成长!
关闭
关闭