feat: add solutions to lc problem: No.0223.Rectangle Area

Author: maolonglong

solution/0200-0299/0223.Rectangle Area/README.md

@@ -24,22 +24,64 @@
 
 <!-- 这里可写通用的实现逻辑 -->
 
+计算重叠部分的面积，注意考虑没有重叠的情况
+
 <!-- tabs:start -->
 
 ### **Python3**
 
 <!-- 这里可写当前语言的特殊实现逻辑 -->
 
 ```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)
 ```
 
 ### **Java**
 
 <!-- 这里可写当前语言的特殊实现逻辑 -->
 
 ```java
+class Solution {
+    public int computeArea(int ax1, int ay1, int ax2, int ay2, int bx1, int by1, int bx2, int by2) {
+        int a = (ax2 - ax1) * (ay2 - ay1);
+        int b = (bx2 - bx1) * (by2 - by1);
+        int width = Math.min(ax2, bx2) - Math.max(ax1, bx1);
+        int height = Math.min(ay2, by2) - Math.max(ay1, by1);
+        return a + b - Math.max(height, 0) * Math.max(width, 0);
+    }
+}
+```
 
+### **Go**
+
+```go
+func computeArea(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)
+}
+
+func max(a, b int) int {
+	if a > b {
+		return a
+	}
+	return b
+}
+
+func min(a, b int) int {
+	if a < b {
+		return a
+	}
+	return b
+}
 ```
 
 ### **...**

solution/0200-0299/0223.Rectangle Area/README_EN.md

@@ -40,13 +40,53 @@
 ### **Python3**
 
 ```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)
 ```
 
 ### **Java**
 
 ```java
+class Solution {
+    public int computeArea(int ax1, int ay1, int ax2, int ay2, int bx1, int by1, int bx2, int by2) {
+        int a = (ax2 - ax1) * (ay2 - ay1);
+        int b = (bx2 - bx1) * (by2 - by1);
+        int width = Math.min(ax2, bx2) - Math.max(ax1, bx1);
+        int height = Math.min(ay2, by2) - Math.max(ay1, by1);
+        return a + b - Math.max(height, 0) * Math.max(width, 0);
+    }
+}
+```
 
+### **Go**
+
+```go
+func computeArea(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)
+}
+
+func max(a, b int) int {
+	if a > b {
+		return a
+	}
+	return b
+}
+
+func min(a, b int) int {
+	if a < b {
+		return a
+	}
+	return b
+}
 ```
 
 ### **...**

solution/0200-0299/0223.Rectangle Area/Solution.go

@@ -0,0 +1,21 @@
+func computeArea(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)
+}
+
+func max(a, b int) int {
+	if a > b {
+		return a
+	}
+	return b
+}
+
+func min(a, b int) int {
+	if a < b {
+		return a
+	}
+	return b
+}

solution/0200-0299/0223.Rectangle Area/Solution.java

@@ -1,8 +1,9 @@
 class Solution {
-    public int computeArea(int A, int B, int C, int D, int E, int F, int G, int H) {
-        long x = (long) Math.min(C, G) - Math.max(A, E);
-        long y = (long) Math.min(D, H) - Math.max(B, F);
-        int intersection = x > 0 && y > 0 ? (int) (x * y) : 0;
-        return (C - A) * (D - B) + (G - E) * (H - F) - intersection;
+    public int computeArea(int ax1, int ay1, int ax2, int ay2, int bx1, int by1, int bx2, int by2) {
+        int a = (ax2 - ax1) * (ay2 - ay1);
+        int b = (bx2 - bx1) * (by2 - by1);
+        int width = Math.min(ax2, bx2) - Math.max(ax1, bx1);
+        int height = Math.min(ay2, by2) - Math.max(ay1, by1);
+        return a + b - Math.max(height, 0) * Math.max(width, 0);
     }
 }

solution/0200-0299/0223.Rectangle Area/Solution.py

@@ -0,0 +1,7 @@
+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)