Leetcode 223. Rectangle Area (Easy) (cpp)

/*

223. Rectangle Area (Easy)

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.

*/
class Solution {
public:
int computeArea(int A, int B, int C, int D, int E, int F, int G, int H) {
int are = (C - A) * (D - B) + (G - E) * (H -F);
if (E >= C || G <= A || F >= D || H <= B)
return are;
else
return are -= (min(C, G) - max(A, E)) * (min(D, H) - max(B, F));
}
};