【leetcode】223. 矩形面积
#define MAX(a,b) ((a) > (b) ? (a) :(b)) #define MIN(a,b) ((a) < (b) ? (a) :(b)) int computeArea(int A, int B, int C, int D, int E, int F, int G, int H){ int overlap_area = 0; int area = 0; if(!(E >= C|| F >= D || G <= A | H <= B)) { int x1 = MAX(A,E); int x2 = MIN(C,G); int y1 = MAX(F,B); int y2 = MIN(D,H); overlap_area = (x2 - x1) * (y2 - y1); } int area1 = (C - A) * (D - B); int area2 = (G - E) * (H -F ); return area1 + (area2 - overlap_area); }
【推荐】编程新体验,更懂你的AI,立即体验豆包MarsCode编程助手
【推荐】凌霞软件回馈社区,博客园 & 1Panel & Halo 联合会员上线
【推荐】抖音旗下AI助手豆包,你的智能百科全书,全免费不限次数
【推荐】博客园社区专享云产品让利特惠,阿里云新客6.5折上折
【推荐】轻量又高性能的 SSH 工具 IShell:AI 加持,快人一步