feat: add solutions to lc problem: No.1401

No.1401.Circle and Rectangle Overlapping

Author: yanglbme

solution/1400-1499/1401.Circle and Rectangle Overlapping/README.md

@@ -60,22 +60,75 @@
 
 <!-- 这里可写通用的实现逻辑 -->
 
+**方法一：数学**
+
+计算矩形离圆最近的点和圆心的距离是否小于等于半径即可。
+
 <!-- tabs:start -->
 
 ### **Python3**
 
 <!-- 这里可写当前语言的特殊实现逻辑 -->
 
 ```python
-
+class Solution:
+    def checkOverlap(self, radius: int, xCenter: int, yCenter: int, x1: int, y1: int, x2: int, y2: int) -> bool:
+        dx = dy = 0
+        if x1 > xCenter:
+            dx = xCenter - x1
+        elif x2 < xCenter:
+            dx = xCenter - x2
+        if y1 > yCenter:
+            dy = yCenter - y1
+        elif y2 < yCenter:
+            dy = yCenter - y2
+        return dx * dx + dy * dy <= radius * radius
 ```
 
 ### **Java**
 
 <!-- 这里可写当前语言的特殊实现逻辑 -->
 
 ```java
+class Solution {
+    public boolean checkOverlap(int radius, int xCenter, int yCenter, int x1, int y1, int x2, int y2) {
+        int dx = x1 > xCenter ? x1 - xCenter : (x2 < xCenter ? xCenter - x2 : 0);
+        int dy = y1 > yCenter ? y1 - yCenter : (y2 < yCenter ? yCenter - y2 : 0);
+        return dx * dx + dy * dy <= radius * radius;
+    }
+}
+```
+
+### **C++**
+
+```cpp
+class Solution {
+public:
+    bool checkOverlap(int radius, int xCenter, int yCenter, int x1, int y1, int x2, int y2) {
+        int dx = x1 > xCenter ? x1 - xCenter : (x2 < xCenter ? xCenter - x2 : 0);
+        int dy = y1 > yCenter ? y1 - yCenter : (y2 < yCenter ? yCenter - y2 : 0);
+        return dx * dx + dy * dy <= radius * radius;
+    }
+};
+```
 
+### **Go**
+
+```go
+func checkOverlap(radius int, xCenter int, yCenter int, x1 int, y1 int, x2 int, y2 int) bool {
+	dx, dy := 0, 0
+	if x1 > xCenter {
+		dx = x1 - xCenter
+	} else if x2 < xCenter {
+		dx = x2 - xCenter
+	}
+	if y1 > yCenter {
+		dy = y1 - yCenter
+	} else if y2 < yCenter {
+		dy = y2 - yCenter
+	}
+	return dx*dx+dy*dy <= radius*radius
+}
 ```
 
 ### **...**

solution/1400-1499/1401.Circle and Rectangle Overlapping/README_EN.md

@@ -48,13 +48,62 @@
 ### **Python3**
 
 ```python
-
+class Solution:
+    def checkOverlap(self, radius: int, xCenter: int, yCenter: int, x1: int, y1: int, x2: int, y2: int) -> bool:
+        dx = dy = 0
+        if x1 > xCenter:
+            dx = xCenter - x1
+        elif x2 < xCenter:
+            dx = xCenter - x2
+        if y1 > yCenter:
+            dy = yCenter - y1
+        elif y2 < yCenter:
+            dy = yCenter - y2
+        return dx * dx + dy * dy <= radius * radius
 ```
 
 ### **Java**
 
 ```java
+class Solution {
+    public boolean checkOverlap(int radius, int xCenter, int yCenter, int x1, int y1, int x2, int y2) {
+        int dx = x1 > xCenter ? x1 - xCenter : (x2 < xCenter ? xCenter - x2 : 0);
+        int dy = y1 > yCenter ? y1 - yCenter : (y2 < yCenter ? yCenter - y2 : 0);
+        return dx * dx + dy * dy <= radius * radius;
+    }
+}
+```
+
+### **C++**
+
+```cpp
+class Solution {
+public:
+    bool checkOverlap(int radius, int xCenter, int yCenter, int x1, int y1, int x2, int y2) {
+        int dx = x1 > xCenter ? x1 - xCenter : (x2 < xCenter ? xCenter - x2 : 0);
+        int dy = y1 > yCenter ? y1 - yCenter : (y2 < yCenter ? yCenter - y2 : 0);
+        return dx * dx + dy * dy <= radius * radius;
+    }
+};
+```
 
+### **Go**
+
+```go
+func checkOverlap(radius int, xCenter int, yCenter int, x1 int, y1 int, x2 int, y2 int) bool {
+	dx, dy := 0, 0
+	if x1 > xCenter {
+		dx = x1 - xCenter
+	} else if x2 < xCenter {
+		dx = x2 - xCenter
+	}
+	if y1 > yCenter {
+		dy = y1 - yCenter
+	} else if y2 < yCenter {
+		dy = y2 - yCenter
+	}
+	return dx*dx+dy*dy <= radius*radius
+}
 ```
 
 ### **...**

solution/1400-1499/1401.Circle and Rectangle Overlapping/Solution.cpp

@@ -0,0 +1,8 @@
+class Solution {
+public:
+    bool checkOverlap(int radius, int xCenter, int yCenter, int x1, int y1, int x2, int y2) {
+        int dx = x1 > xCenter ? x1 - xCenter : (x2 < xCenter ? xCenter - x2 : 0);
+        int dy = y1 > yCenter ? y1 - yCenter : (y2 < yCenter ? yCenter - y2 : 0);
+        return dx * dx + dy * dy <= radius * radius;
+    }
+};

solution/1400-1499/1401.Circle and Rectangle Overlapping/Solution.go

@@ -0,0 +1,14 @@
+func checkOverlap(radius int, xCenter int, yCenter int, x1 int, y1 int, x2 int, y2 int) bool {
+	dx, dy := 0, 0
+	if x1 > xCenter {
+		dx = x1 - xCenter
+	} else if x2 < xCenter {
+		dx = x2 - xCenter
+	}
+	if y1 > yCenter {
+		dy = y1 - yCenter
+	} else if y2 < yCenter {
+		dy = y2 - yCenter
+	}
+	return dx*dx+dy*dy <= radius*radius
+}

solution/1400-1499/1401.Circle and Rectangle Overlapping/Solution.java

@@ -0,0 +1,7 @@
+class Solution {
+    public boolean checkOverlap(int radius, int xCenter, int yCenter, int x1, int y1, int x2, int y2) {
+        int dx = x1 > xCenter ? x1 - xCenter : (x2 < xCenter ? xCenter - x2 : 0);
+        int dy = y1 > yCenter ? y1 - yCenter : (y2 < yCenter ? yCenter - y2 : 0);
+        return dx * dx + dy * dy <= radius * radius;
+    }
+}

solution/1400-1499/1401.Circle and Rectangle Overlapping/Solution.py

@@ -0,0 +1,12 @@
+class Solution:
+    def checkOverlap(self, radius: int, xCenter: int, yCenter: int, x1: int, y1: int, x2: int, y2: int) -> bool:
+        dx = dy = 0
+        if x1 > xCenter:
+            dx = xCenter - x1
+        elif x2 < xCenter:
+            dx = xCenter - x2
+        if y1 > yCenter:
+            dy = yCenter - y1
+        elif y2 < yCenter:
+            dy = yCenter - y2
+        return dx * dx + dy * dy <= radius * radius