Java for Leetcode 223 Rectangle area

Find the total area covered by and rectilinear rectangles in a 2D plane.

Each rectangle was defined by its bottom left corner and top right corner as shown in the figure.

Assume 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.

Problem Solving Ideas:

The Java implementation is as follows:

    public int Computearea (int A, int B, int C, int D, int E, int F, int G, int H) {        int minu=0;        if (e>=c| | g<=a| | f>=d| | H<=B)        minu=0;        Else minu= (Math.min (g,c)-math.max (a,e)) * (Math.min (D, H)-math.max (F, B));        Return (C-A) * (d-b) + (G-E) * (h-f)-minu;     }

Java for Leetcode 223 Rectangle area