feat: add solutions to lc problem: No.1637

No.1637.Widest Vertical Area Between Two Points Containing No Points

Author: yanglbme

solution/1600-1699/1637.Widest Vertical Area Between Two Points Containing No Points/README.md

@@ -44,22 +44,76 @@
 
 <!-- 这里可写通用的实现逻辑 -->
 
+**方法一：排序**
+
+对 $points$ 按照 $x$ 升序排列，获取相邻点之间 $x$ 的差值的最大值。
+
+时间复杂度 $O(nlogn)$，其中 $n$ 表示 $points$ 的长度。
+
 <!-- tabs:start -->
 
 ### **Python3**
 
 <!-- 这里可写当前语言的特殊实现逻辑 -->
 
 ```python
-
+class Solution:
+    def maxWidthOfVerticalArea(self, points: List[List[int]]) -> int:
+        points.sort()
+        return max(b[0] - a[0] for a, b in pairwise(points))
 ```
 
 ### **Java**
 
 <!-- 这里可写当前语言的特殊实现逻辑 -->
 
 ```java
+class Solution {
+    public int maxWidthOfVerticalArea(int[][] points) {
+        Arrays.sort(points, (a, b) -> a[0] - b[0]);
+        int ans = 0;
+        for (int i = 0; i < points.length - 1; ++i) {
+            ans = Math.max(ans, points[i + 1][0] - points[i][0]);
+        }
+        return ans;
+    }
+}
+```
+
+### **C++**
+
+```cpp
+class Solution {
+public:
+    int maxWidthOfVerticalArea(vector<vector<int>>& points) {
+        sort(points.begin(), points.end());
+        int ans = 0;
+        for (int i = 0; i < points.size() - 1; ++i) ans = max(ans, points[i + 1][0] - points[i][0]);
+        return ans;
+    }
+};
+```
 
+### **Go**
+
+```go
+func maxWidthOfVerticalArea(points [][]int) int {
+	sort.Slice(points, func(i, j int) bool {
+		return points[i][0] < points[j][0]
+	})
+	ans := 0
+	for i, p := range points[1:] {
+		ans = max(ans, p[0]-points[i][0])
+	}
+	return ans
+}
+
+func max(a, b int) int {
+	if a > b {
+		return a
+	}
+	return b
+}
 ```
 
 ### **...**

solution/1600-1699/1637.Widest Vertical Area Between Two Points Containing No Points/README_EN.md

@@ -43,13 +43,61 @@
 ### **Python3**
 
 ```python
-
+class Solution:
+    def maxWidthOfVerticalArea(self, points: List[List[int]]) -> int:
+        points.sort()
+        return max(b[0] - a[0] for a, b in pairwise(points))
 ```
 
 ### **Java**
 
 ```java
+class Solution {
+    public int maxWidthOfVerticalArea(int[][] points) {
+        Arrays.sort(points, (a, b) -> a[0] - b[0]);
+        int ans = 0;
+        for (int i = 0; i < points.length - 1; ++i) {
+            ans = Math.max(ans, points[i + 1][0] - points[i][0]);
+        }
+        return ans;
+    }
+}
+```
+
+### **C++**
+
+```cpp
+class Solution {
+public:
+    int maxWidthOfVerticalArea(vector<vector<int>>& points) {
+        sort(points.begin(), points.end());
+        int ans = 0;
+        for (int i = 0; i < points.size() - 1; ++i) ans = max(ans, points[i + 1][0] - points[i][0]);
+        return ans;
+    }
+};
+```
 
+### **Go**
+
+```go
+func maxWidthOfVerticalArea(points [][]int) int {
+	sort.Slice(points, func(i, j int) bool {
+		return points[i][0] < points[j][0]
+	})
+	ans := 0
+	for i, p := range points[1:] {
+		ans = max(ans, p[0]-points[i][0])
+	}
+	return ans
+}
+
+func max(a, b int) int {
+	if a > b {
+		return a
+	}
+	return b
+}
 ```
 
 ### **...**

solution/1600-1699/1637.Widest Vertical Area Between Two Points Containing No Points/Solution.cpp

@@ -0,0 +1,9 @@
+class Solution {
+public:
+    int maxWidthOfVerticalArea(vector<vector<int>>& points) {
+        sort(points.begin(), points.end());
+        int ans = 0;
+        for (int i = 0; i < points.size() - 1; ++i) ans = max(ans, points[i + 1][0] - points[i][0]);
+        return ans;
+    }
+};

solution/1600-1699/1637.Widest Vertical Area Between Two Points Containing No Points/Solution.go

@@ -0,0 +1,17 @@
+func maxWidthOfVerticalArea(points [][]int) int {
+	sort.Slice(points, func(i, j int) bool {
+		return points[i][0] < points[j][0]
+	})
+	ans := 0
+	for i, p := range points[1:] {
+		ans = max(ans, p[0]-points[i][0])
+	}
+	return ans
+}
+
+func max(a, b int) int {
+	if a > b {
+		return a
+	}
+	return b
+}

solution/1600-1699/1637.Widest Vertical Area Between Two Points Containing No Points/Solution.java

@@ -0,0 +1,10 @@
+class Solution {
+    public int maxWidthOfVerticalArea(int[][] points) {
+        Arrays.sort(points, (a, b) -> a[0] - b[0]);
+        int ans = 0;
+        for (int i = 0; i < points.length - 1; ++i) {
+            ans = Math.max(ans, points[i + 1][0] - points[i][0]);
+        }
+        return ans;
+    }
+}

solution/1600-1699/1637.Widest Vertical Area Between Two Points Containing No Points/Solution.py

@@ -0,0 +1,4 @@
+class Solution:
+    def maxWidthOfVerticalArea(self, points: List[List[int]]) -> int:
+        points.sort()
+        return max(b[0] - a[0] for a, b in pairwise(points))

solution/2200-2299/2241.Design an ATM Machine/Solution.py

@@ -1,5 +1,4 @@
 class ATM:
-
     def __init__(self):
         self.cnt = [0] * 5
         self.m = [500, 200, 100, 50, 20]