https://leetcode.com/problems/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.
Example:
Input: A = -3, B = 0, C = 3, D = 4, E = 0, F = -1, G = 9, H = 2
Output: 45
Note:
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 sum = (C - A) * (D - B) + (H - F) * (G - E);
if (E >= C || F >= D || B >= H || A >= G) return sum;
return sum - ((min(G, C) - max(A, E)) * (min(D, H) - max(B, F)));
}
};
先算出来两个面积的和 然后判断有没有重合 如果有减去重合如果没有直接返回面积和
FH
#Leetcode# 223. Rectangle Area
原文：https://www.cnblogs.com/zlrrrr/p/10364744.html