爱敲代码的小赤佬

class Solution { public: int computeArea(int ax1, int ay1, int ax2, int ay2, int bx1, int by1, int bx2, int by2) { int s1 = (ax2-ax1)*(ay2-ay1); int s2 = (bx2 - bx1)*(by2 - by1); //定重叠长方形的左右上下位置。 int overw = min(ax2,bx2) - max(.