题目:
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.
题意:
找到由两个二维平面直角坐标系所构成的矩形所覆盖的总面积。
定义每个矩形的左下角和右上角如图。
可以假定总面积没有超过int(整形)的最大可能值。
思路:
主要是确定中间重复覆盖区域的面积,拿两个矩形总面积减去重叠部分的面积;
代码:32ms
class Solution { public: int computeArea(int A, int B, int C, int D, int E, int F, int G, int H) { int left = max(A,E), right = max(min(C,G), left); int bottom = max(B,F), top = max(min(D,H), bottom); return (C-A)*(D-B) - (right-left)*(top-bottom) + (G-E)*(H-F); } };