(LeetCode 223) 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.

題意簡單，給你兩個矩形，求它的總面積

solution:
單純的條件判斷，就不細說了。

class Solution {
public:
    int computeArea(int A, int B, int C, int D, int E, int F, int G, int H) {
        int area = (C-A)*(D-B)+(G-E)*(H-F);
        if(E>=C||G<=A||F>=D||H<=B)return area;
        int blX = (E>A)?E:A;
        int blY = (B>F)?B:F;
        int trX = (C<G)?C:G;
        int trY = (D<H)?D:H;
        return area-(trX-blX)*(trY-blY);
    }
};