//#223 Rectangle Area
//32ms 98.98%
class Solution {
public:
int computeArea(int A, int B, int C, int D, int E, int F, int G, int H)
{
int c1(0), c2(0), c3(0), c4(0);
if(A>=E) c1=A; else c1=E;
if(B>=F) c2=B; else c2=F;
if(C>=G) c3=G; else c3=C;
if(D>=H) c4=H; else c4=D;
return computeSingleArea(A,B,C,D) + computeSingleArea(E,F,G,H) - computeSingleArea(c1,c2,c3,c4);
}
int computeSingleArea(int a, int b, int c, int d)
{
if(a>=c || b>=d) return 0;
return (c-a)*(d-b);
}
};
[Leetcode]#223 Rectangle Area
最新推荐文章于 2024-08-04 16:45:57 发布