223. Rectangle Area

来源：互联网发布：玲珑网游加速器mac 编辑：程序博客网时间：2024/04/23 18:43

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.

class Solution {public:    int computeArea(int A, int B, int C, int D, int E, int F, int G, int H) {        int left_Xmax=max(A,E);        int left_Ymax=max(B,F);        int right_Xmin=min(C,G);        int right_Ymin=min(D,H);        int area1=(D-B)*(C-A);        int area2=(H-F)*(G-E);        long long area3=0;        long long a=(long long)right_Xmin-(long long)left_Xmax;        long long b=(long long)right_Ymin-(long long)left_Ymax;        if(a>0&&b>0)        {            area3=a*b;        }        return area1+area2-area3;    }};

思路就是两个矩形面积相加再减去共同面积。
但是，使用比较大小的方法会比较好。

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

0 0