feat: add typescript solution to lc problem: No.2058 (doocs#599)

No.2058.Find the Minimum and Maximum Number of Nodes Between Critical Points

Author: zhaocchen

solution/2000-2099/2058.Find the Minimum and Maximum Number of Nodes Between Critical Points/README.md

@@ -99,6 +99,48 @@
 
 ```
 
+### **TypeScript**
+
+```ts
+/**
+ * Definition for singly-linked list.
+ * class ListNode {
+ *     val: number
+ *     next: ListNode | null
+ *     constructor(val?: number, next?: ListNode | null) {
+ *         this.val = (val===undefined ? 0 : val)
+ *         this.next = (next===undefined ? null : next)
+ *     }
+ * }
+ */
+
+function nodesBetweenCriticalPoints(head: ListNode | null): number[] {
+    let idx = 1;
+    let pre = head.val;
+    head = head.next;
+    let nums = [];
+    while(head.next != null) {
+        let val = head.val, post = head.next.val;
+        if (pre < val && val > post) {
+            nums.push(idx);
+        }
+        if (pre > val && val < post) {
+            nums.push(idx);
+        }
+        pre = val;
+        idx++;
+        head = head.next;
+    }
+    let n = nums.length;
+    if (n < 2) return [-1, -1];
+    let min = Infinity;
+    for (let i = 1; i < n; i++) {
+        min = Math.min(nums[i] - nums[i - 1], min);
+    }
+    return [min, nums[n - 1] - nums[0]];
+};
+```
+
 ### **...**
 
 ```

solution/2000-2099/2058.Find the Minimum and Maximum Number of Nodes Between Critical Points/README_EN.md

@@ -81,6 +81,48 @@ Note that the last node is not considered a local maxima because it does not hav
 
 ```
 
+### **TypeScript**
+
+```ts
+/**
+ * Definition for singly-linked list.
+ * class ListNode {
+ *     val: number
+ *     next: ListNode | null
+ *     constructor(val?: number, next?: ListNode | null) {
+ *         this.val = (val===undefined ? 0 : val)
+ *         this.next = (next===undefined ? null : next)
+ *     }
+ * }
+ */
+
+function nodesBetweenCriticalPoints(head: ListNode | null): number[] {
+    let idx = 1;
+    let pre = head.val;
+    head = head.next;
+    let nums = [];
+    while(head.next != null) {
+        let val = head.val, post = head.next.val;
+        if (pre < val && val > post) {
+            nums.push(idx);
+        }
+        if (pre > val && val < post) {
+            nums.push(idx);
+        }
+        pre = val;
+        idx++;
+        head = head.next;
+    }
+    let n = nums.length;
+    if (n < 2) return [-1, -1];
+    let min = Infinity;
+    for (let i = 1; i < n; i++) {
+        min = Math.min(nums[i] - nums[i - 1], min);
+    }
+    return [min, nums[n - 1] - nums[0]];
+};
+```
+
 ### **...**
 
 ```

solution/2000-2099/2058.Find the Minimum and Maximum Number of Nodes Between Critical Points/Solution.ts

@@ -0,0 +1,37 @@
+/**
+ * Definition for singly-linked list.
+ * class ListNode {
+ *     val: number
+ *     next: ListNode | null
+ *     constructor(val?: number, next?: ListNode | null) {
+ *         this.val = (val===undefined ? 0 : val)
+ *         this.next = (next===undefined ? null : next)
+ *     }
+ * }
+ */
+
+ function nodesBetweenCriticalPoints(head: ListNode | null): number[] {
+    let idx = 1;
+    let pre = head.val;
+    head = head.next;
+    let nums = [];
+    while(head.next != null) {
+        let val = head.val, post = head.next.val;
+        if (pre < val && val > post) {
+            nums.push(idx);
+        }
+        if (pre > val && val < post) {
+            nums.push(idx);
+        }
+        pre = val;
+        idx++;
+        head = head.next;
+    }
+    let n = nums.length;
+    if (n < 2) return [-1, -1];
+    let min = Infinity;
+    for (let i = 1; i < n; i++) {
+        min = Math.min(nums[i] - nums[i - 1], min);
+    }
+    return [min, nums[n - 1] - nums[0]];
+};