# 左下角和右上角的点
def computeArea(A, B, C, D, E, F, G, H):
overlap = max(min(C, G) - max(A, E), 0) * max(min(D, H) - max(B, F), 0)
return (A - C) * (B - D) + (E - G) * (F - H) - overlap
# 左下角和右上角的点
def computeArea(A, B, C, D, E, F, G, H):
overlap = max(min(C, G) - max(A, E), 0) * max(min(D, H) - max(B, F), 0)
return (A - C) * (B - D) + (E - G) * (F - H) - overlap