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.

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 result = (C - A) * (D - B) + (G - E) * (H - F);
        if (E < C && G > A && F < D && H > B) {
            result -= (min(C, G) - max(A, E)) * (min(D, H) - max(B, F));
        }
        
        return result;
    }
};