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

解法一：

思想就是两个矩形的面积之和减去交集。这个一行code最后发现报错了，因为min(G,C)-max(A,E)超出int的范围了。

class Solution {
public:
    int computeArea(int A, int B, int C, int D, int E, int F, int G, int H) {
        return (C-A)*(D-B) + (G-E)*(H-F) - 
            max(0,min(G,C) - max(A,E))*max(0,min(D,H)-max(F,B));
        
    }
};

解法二：

做了点改动，不用第二层max，使用c++自己的conditional operator。

class Solution {
public:
    int computeArea(int A, int B, int C, int D, int E, int F, int G, int H) {
        int m = min(G,C)>max(A,E)?min(G,C)-max(A,E):0;
        int n = min(D,H)>max(F,B)?min(D,H)-max(F,B):0;
        return (C-A)*(D-B) + (G-E)*(H-F) - m*n;
    }
};