leetCode(33):Rectangle Area 分类: leetCode 2015-07-08 08:06 125人阅读 评论(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;//面积之和减去重合部分面积 } } };
【推荐】编程新体验,更懂你的AI,立即体验豆包MarsCode编程助手
【推荐】凌霞软件回馈社区,博客园 & 1Panel & Halo 联合会员上线
【推荐】抖音旗下AI助手豆包,你的智能百科全书,全免费不限次数
【推荐】轻量又高性能的 SSH 工具 IShell:AI 加持,快人一步