基本思想:
简单题;
基本代码:
class Solution {
public:
int computeArea(int ax1, int ay1, int ax2, int ay2, int bx1, int by1, int bx2, int by2) {
int a=(ax2-ax1)*(ay2-ay1);
int b=(bx2-bx1)*(by2-by1);
int lenght=0,height=0;
if(ax2<=bx1||ax1>=bx2||ay1>=by2||ay2<=by1)
return a+b;
vector<int> vec={ax1,ax2,bx1,bx2};
sort(vec.begin(),vec.end());
lenght=vec[2]-vec[1];
vec={ay1,ay2,by1,by2};
sort(vec.begin(),vec.end());
height=vec[2]-vec[1];
return a+b-height*lenght;
}
};