223. 矩形面积
嗯···如题解,找上边小的和下边大的,左边大的和右边小的
class Solution {
public:
int computeArea(int ax1, int ay1, int ax2, int ay2, int bx1, int by1, int bx2, int by2) {
int s1 = (ay2-ay1) * (ax2-ax1);
int s2 = (by2-by1) * (bx2-bx1);
int s3 =0;
if((min(by2,ay2)-max(ay1,by1)) >0 && (min(bx2,ax2) - max(ax1,bx1))>0)
s3 = (min(by2,ay2)-max(ay1,by1)) * (min(bx2,ax2) - max(ax1,bx1));
cout<< (min(by2,ay2)-max(ay1,by1)) <<s2 <<s3;
return s1+s2-s3;
}
};