[LeetCode] Rectangle Area

Rectangle Area Find the total area covered by two rectilinear rectangles in a 2D plane. Each rectangle is defined by its bottom left corner and top right corner as shown in the figure.
Assume that the total area is never beyond the maximum possible value of int.
Credits: Special thanks to @mithmatt for adding this problem, creating the above image and all test cases.
問題解決の考え方:
2つの矩形の合計被覆面積を計算することを意味し、計算方法は矩形1の面積+矩形2の面積−2つの矩形の共通の被覆面積である.

class Solution {
public:
    int computeArea(int A, int B, int C, int D, int E, int F, int G, int H) {
        int overLeft = max(A, E);
        int overBottom = max(B, F);
        int overRight = min(C, G);
        int overTop = min(D, H);
        
        int overArea = 0;
        if(overLeft>=overRight || overBottom>=overTop){
            overArea = 0;
        }else{
            overArea = (overRight-overLeft) * (overTop - overBottom);
        }
        return (C-A)*(D-B) + (G-E)*(H-F) - overArea;
    }
};