题目:
求矩阵并。
思路:
容斥原理
代码:
class Solution {
public:
int a[4],b[4];
int computeArea(int A, int B, int C, int D, int E, int F, int G, int H) {
int x = min(C,G) > max(A,E) ? min(C,G) - max(A,E) : 0;
int y = min(D,H) > max(B,F) ? min(D,H) - max(B,F) : 0;
return (A - C) * (B - D) + (E - G) * (F - H) - x * y;
}
};