Leetcode: 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.

Rectangle Area
Assume that the total area is never beyond the maximum possible value of int.

public class Solution {
    public int computeArea(int A, int B, int C, int D, int E, int F, int G, int H) {
        int area3 = 0;
        int area1 = (C-A) * (D-B);
        int area2 = (G-E) * (H-F);
        if (C<=E || G<=A || H<=B || D<=F) area3 = 0;
        else area3 = (Math.min(C,G)-Math.max(A,E)) * (Math.min(D,H)-Math.max(B,F));
        return area1 + area2 - area3;
    }
}