上次编辑到这里，代码来自缓存 点击恢复默认模板
class Solution {
public:
int computeArea(int ax1, int ay1, int ax2, int ay2, int bx1, int by1, int bx2, int by2) {
}
};
golang 解法, 执行用时: 4 ms, 内存消耗: 6 MB, 提交时间: 2022-11-24 11:15:09
func computeArea(ax1, ay1, ax2, ay2, bx1, by1, bx2, by2 int) int {
area1 := (ax2 - ax1) * (ay2 - ay1)
area2 := (bx2 - bx1) * (by2 - by1)
overlapWidth := min(ax2, bx2) - max(ax1, bx1)
overlapHeight := min(ay2, by2) - max(ay1, by1)
overlapArea := max(overlapWidth, 0) * max(overlapHeight, 0)
return area1 + area2 - overlapArea
}
func min(a, b int) int {
if a > b {
return b
}
return a
}
func max(a, b int) int {
if b > a {
return b
}
return a
}
python3 解法, 执行用时: 68 ms, 内存消耗: 15 MB, 提交时间: 2022-11-24 11:14:33
class Solution:
def computeArea(self, ax1: int, ay1: int, ax2: int, ay2: int, bx1: int, by1: int, bx2: int, by2: int) -> int:
area1 = (ax2 - ax1) * (ay2 - ay1)
area2 = (bx2 - bx1) * (by2 - by1)
overlapWidth = min(ax2, bx2) - max(ax1, bx1)
overlapHeight = min(ay2, by2) - max(ay1, by1)
overlapArea = max(overlapWidth, 0) * max(overlapHeight, 0)
return area1 + area2 - overlapArea
