add 2058

fishercoder1534 · fishercoder1534 · commit f82c7fe6c555 · 2021-10-31T08:01:45.000-07:00
diff --git a/README.md b/README.md
@@ -8,6 +8,7 @@ _If you like this project, please leave me a star._ &#9733;
 
 |  #  |      Title     |   Solutions   | Video  | Difficulty  | Tag                  
 |-----|----------------|---------------|--------|-------------|-------------
+|2058|[Find the Minimum and Maximum Number of Nodes Between Critical Points](https://leetcode.com/problems/find-the-minimum-and-maximum-number-of-nodes-between-critical-points/)|[Java](../master/src/main/java/com/fishercoder/solutions/_2058.java) ||Medium||
 |2057|[Smallest Index With Equal Value](https://leetcode.com/problems/smallest-index-with-equal-value/)|[Java](../master/src/main/java/com/fishercoder/solutions/_2057.java) ||Easy||
 |2055|[Plates Between Candles](https://leetcode.com/problems/plates-between-candles/)|[Java](../master/src/main/java/com/fishercoder/solutions/_2055.java) ||Medium||
 |2054|[Two Best Non-Overlapping Events](https://leetcode.com/problems/two-best-non-overlapping-events/)|[Java](../master/src/main/java/com/fishercoder/solutions/_2054.java) ||Medium||
diff --git a/src/main/java/com/fishercoder/solutions/_2058.java b/src/main/java/com/fishercoder/solutions/_2058.java
@@ -0,0 +1,35 @@
+package com.fishercoder.solutions;
+
+import com.fishercoder.common.classes.ListNode;
+
+import java.util.ArrayList;
+import java.util.List;
+
+public class _2058 {
+    public static class Solution1 {
+        public int[] nodesBetweenCriticalPoints(ListNode head) {
+            List<Integer> list = new ArrayList<>();
+            while (head != null) {
+                list.add(head.val);
+                head = head.next;
+            }
+            List<Integer> criticalPts = new ArrayList<>();
+            for (int i = 1; i < list.size() - 1; i++) {
+                if (list.get(i) > list.get(i - 1) && list.get(i) > list.get(i + 1)) {
+                    criticalPts.add(i);
+                } else if (list.get(i) < list.get(i - 1) && list.get(i) < list.get(i + 1)) {
+                    criticalPts.add(i);
+                }
+            }
+            if (criticalPts.size() < 2) {
+                return new int[]{-1, -1};
+            }
+            int min = Integer.MAX_VALUE;
+            for (int i = 0; i < criticalPts.size() - 1; i++) {
+                min = Math.min(min, criticalPts.get(i + 1) - criticalPts.get(i));
+            }
+            int size = criticalPts.size();
+            return new int[]{min, criticalPts.get(size - 1) - criticalPts.get(0)};
+        }
+    }
+}
