feat: add solutions to lc problem: No.1574 (#3765)

Author: rain84

solution/1500-1599/1574.Shortest Subarray to be Removed to Make Array Sorted/README.md

@@ -326,6 +326,46 @@ func findLengthOfShortestSubarray(arr []int) int {
 }
 ```
 
+#### TypeScript
+
+```ts
+function findLengthOfShortestSubarray(arr: number[]): number {
+    let [l, r, n] = [0, arr.length - 1, arr.length];
+
+    while (r && arr[r - 1] <= arr[r]) r--;
+    if (r === 0) return 0;
+
+    let ans = r;
+    while (l < r && (!l || arr[l - 1] <= arr[l])) {
+        while (r < n && arr[l] > arr[r]) r++;
+        ans = Math.min(ans, r - l - 1);
+        l++;
+    }
+
+    return ans;
+}
+```
+
+#### JavaScript
+
+```js
+function findLengthOfShortestSubarray(arr) {
+    let [l, r, n] = [0, arr.length - 1, arr.length];
+
+    while (r && arr[r - 1] <= arr[r]) r--;
+    if (r === 0) return 0;
+
+    let ans = r;
+    while (l < r && (!l || arr[l - 1] <= arr[l])) {
+        while (r < n && arr[l] > arr[r]) r++;
+        ans = Math.min(ans, r - l - 1);
+        l++;
+    }
+
+    return ans;
+}
+```
+
 <!-- tabs:end -->
 
 <!-- solution:end -->

solution/1500-1599/1574.Shortest Subarray to be Removed to Make Array Sorted/README_EN.md

@@ -298,6 +298,46 @@ func findLengthOfShortestSubarray(arr []int) int {
 }
 ```
 
+#### TypeScript
+
+```ts
+function findLengthOfShortestSubarray(arr: number[]): number {
+    let [l, r, n] = [0, arr.length - 1, arr.length];
+
+    while (r && arr[r - 1] <= arr[r]) r--;
+    if (r === 0) return 0;
+
+    let ans = r;
+    while (l < r && (!l || arr[l - 1] <= arr[l])) {
+        while (r < n && arr[l] > arr[r]) r++;
+        ans = Math.min(ans, r - l - 1);
+        l++;
+    }
+
+    return ans;
+}
+```
+
+#### JavaScript
+
+```js
+function findLengthOfShortestSubarray(arr) {
+    let [l, r, n] = [0, arr.length - 1, arr.length];
+
+    while (r && arr[r - 1] <= arr[r]) r--;
+    if (r === 0) return 0;
+
+    let ans = r;
+    while (l < r && (!l || arr[l - 1] <= arr[l])) {
+        while (r < n && arr[l] > arr[r]) r++;
+        ans = Math.min(ans, r - l - 1);
+        l++;
+    }
+
+    return ans;
+}
+```
+
 <!-- tabs:end -->
 
 <!-- solution:end -->

solution/1500-1599/1574.Shortest Subarray to be Removed to Make Array Sorted/Solution2.js

@@ -0,0 +1,15 @@
+function findLengthOfShortestSubarray(arr) {
+    let [l, r, n] = [0, arr.length - 1, arr.length];
+
+    while (r && arr[r - 1] <= arr[r]) r--;
+    if (r === 0) return 0;
+
+    let ans = r;
+    while (l < r && (!l || arr[l - 1] <= arr[l])) {
+        while (r < n && arr[l] > arr[r]) r++;
+        ans = Math.min(ans, r - l - 1);
+        l++;
+    }
+
+    return ans;
+}

solution/1500-1599/1574.Shortest Subarray to be Removed to Make Array Sorted/Solution2.ts

@@ -0,0 +1,15 @@
+function findLengthOfShortestSubarray(arr: number[]): number {
+    let [l, r, n] = [0, arr.length - 1, arr.length];
+
+    while (r && arr[r - 1] <= arr[r]) r--;
+    if (r === 0) return 0;
+
+    let ans = r;
+    while (l < r && (!l || arr[l - 1] <= arr[l])) {
+        while (r < n && arr[l] > arr[r]) r++;
+        ans = Math.min(ans, r - l - 1);
+        l++;
+    }
+
+    return ans;
+}