add a solution for 1637

fishercoder1534 · fishercoder1534 · commit a779a8bae306 · 2021-10-17T11:05:13.000-07:00
diff --git a/README.md b/README.md
@@ -178,7 +178,7 @@ _If you like this project, please leave me a star._ &#9733;
 |1642|[Furthest Building You Can Reach](https://leetcode.com/problems/furthest-building-you-can-reach/)|[Solution](../master/src/main/java/com/fishercoder/solutions/_1642.java) ||Medium|Binary Search, Heap|
 |1641|[Count Sorted Vowel Strings](https://leetcode.com/problems/count-sorted-vowel-strings/)|[Solution](../master/src/main/java/com/fishercoder/solutions/_1641.java) |[:tv:](https://youtu.be/gdH4yfgfwiU)|Medium|Math, DP, Backtracking|
 |1640|[Check Array Formation Through Concatenation](https://leetcode.com/problems/check-array-formation-through-concatenation/)|[Solution](../master/src/main/java/com/fishercoder/solutions/_1640.java) ||Easy|Array, Sort|
-|1637|[Widest Vertical Area Between Two Points Containing No Points](https://leetcode.com/problems/widest-vertical-area-between-two-points-containing-no-points/)|[Javascript](./javascript/_1637.js)| | Medium | Sort |
+|1637|[Widest Vertical Area Between Two Points Containing No Points](https://leetcode.com/problems/widest-vertical-area-between-two-points-containing-no-points/)|[Javascript](./javascript/_1637.js), [Java](../master/src/main/java/com/fishercoder/solutions/_1637.java)| | Medium | Sort |
 |1636|[Sort Array by Increasing Frequency](https://leetcode.com/problems/sort-array-by-increasing-frequency/)|[Solution](../master/src/main/java/com/fishercoder/solutions/_1636.java) ||Easy|Array, Sort|
 |1630|[Arithmetic Subarrays](https://leetcode.com/problems/arithmetic-subarrays/)|[Solution](../master/src/main/java/com/fishercoder/solutions/_1630.java) ||Medium|Sort|
 |1629|[Slowest Key](https://leetcode.com/problems/slowest-key/)|[Solution](../master/src/main/java/com/fishercoder/solutions/_1629.java) ||Easy|Array|
diff --git a/src/main/java/com/fishercoder/solutions/_1637.java b/src/main/java/com/fishercoder/solutions/_1637.java
@@ -0,0 +1,25 @@
+package com.fishercoder.solutions;
+
+import java.util.ArrayList;
+import java.util.List;
+import java.util.TreeSet;
+
+public class _1637 {
+    public static class Solution1 {
+        public int maxWidthOfVerticalArea(int[][] points) {
+            TreeSet<Integer> treeSet = new TreeSet<>();
+            for (int[] point : points) {
+                treeSet.add(point[0]);
+            }
+            int ans = 0;
+            List<Integer> list = new ArrayList<>();
+            for (int x : treeSet) {
+                list.add(x);
+            }
+            for (int i = 0; i < list.size() - 1; i++) {
+                ans = Math.max(ans, list.get(i + 1) - list.get(i));
+            }
+            return ans;
+        }
+    }
+}
