1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
|
#include "leetcode.h"
class Solution {
public:
int computeArea(int ax1, int ay1, int ax2, int ay2, int bx1, int by1, int bx2,
int by2) {
return (ax2 - ax1) * (ay2 - ay1) + (bx2 - bx1) * (by2 - by1) -
max(min(ax2, bx2) - max(ax1, bx1), 0) *
max(min(ay2, by2) - max(ay1, by1), 0);
}
};
int main() {
Solution obj;
cout << obj.computeArea(-3, 0, 3, 4, 0, -1, 9, 2);
}
|