mirror of https://github.com/doocs/leetcode.git
18 lines
432 B
Python
18 lines
432 B
Python
class Solution:
|
|
def computeArea(
|
|
self,
|
|
ax1: int,
|
|
ay1: int,
|
|
ax2: int,
|
|
ay2: int,
|
|
bx1: int,
|
|
by1: int,
|
|
bx2: int,
|
|
by2: int,
|
|
) -> int:
|
|
a = (ax2 - ax1) * (ay2 - ay1)
|
|
b = (bx2 - bx1) * (by2 - by1)
|
|
width = min(ax2, bx2) - max(ax1, bx1)
|
|
height = min(ay2, by2) - max(ay1, by1)
|
|
return a + b - max(height, 0) * max(width, 0)
|