+ problem 1574

fruit-in · fruit-in · commit bc0da71c22be · 2023-11-24T17:52:16.000+08:00
diff --git a/Problemset/1574-Shortest Subarray to be Removed to Make Array Sorted/README.md b/Problemset/1574-Shortest Subarray to be Removed to Make Array Sorted/README.md
@@ -0,0 +1,69 @@
+# 1574. Shortest Subarray to be Removed to Make Array Sorted
+Given an integer array `arr`, remove a subarray (can be empty) from `arr` such that the remaining elements in `arr` are **non-decreasing**.
+
+Return *the length of the shortest subarray to remove*.
+
+A **subarray** is a contiguous subsequence of the array.
+
+#### Example 1:
+<pre>
+<strong>Input:</strong> arr = [1,2,3,10,4,2,3,5]
+<strong>Output:</strong> 3
+<strong>Explanation:</strong> The shortest subarray we can remove is [10,4,2] of length 3. The remaining elements after that will be [1,2,3,3,5] which are sorted.
+Another correct solution is to remove the subarray [3,10,4].
+</pre>
+
+#### Example 2:
+<pre>
+<strong>Input:</strong> arr = [5,4,3,2,1]
+<strong>Output:</strong> 4
+<strong>Explanation:</strong> Since the array is strictly decreasing, we can only keep a single element. Therefore we need to remove a subarray of length 4, either [5,4,3,2] or [4,3,2,1].
+</pre>
+
+#### Example 3:
+<pre>
+<strong>Input:</strong> arr = [1,2,3]
+<strong>Output:</strong> 0
+<strong>Explanation:</strong> The array is already non-decreasing. We do not need to remove any elements.
+</pre>
+
+#### Constraints:
+* <code>1 <= arr.length <= 10<sup>5</sup></code>
+* <code>0 <= arr[i] <= 10<sup>9</sup></code>
+
+## Solutions (Rust)
+
+### 1. Solution
+```Rust
+impl Solution {
+    pub fn find_length_of_shortest_subarray(arr: Vec<i32>) -> i32 {
+        let mut arr = arr;
+        let mut i = arr.len();
+        let mut ret = arr.len() - 1;
+
+        arr.insert(0, 0);
+
+        while i > 0 && arr[i - 1] <= arr[i] {
+            i -= 1;
+        }
+
+        if i == 0 {
+            return 0;
+        }
+
+        for j in 0..arr.len() {
+            if j > 0 && arr[j - 1] > arr[j] {
+                break;
+            }
+
+            while i < arr.len() && arr[i] < arr[j] {
+                i += 1;
+            }
+
+            ret = ret.min(i - j - 1);
+        }
+
+        ret as i32
+    }
+}
+```
diff --git a/Problemset/1574-Shortest Subarray to be Removed to Make Array Sorted/README_CN.md b/Problemset/1574-Shortest Subarray to be Removed to Make Array Sorted/README_CN.md
@@ -0,0 +1,75 @@
+# 1574. 删除最短的子数组使剩余数组有序
+给你一个整数数组 `arr` ，请你删除一个子数组（可以为空），使得 `arr` 中剩下的元素是 **非递减** 的。
+
+一个子数组指的是原数组中连续的一个子序列。
+
+请你返回满足题目要求的最短子数组的长度。
+
+#### 示例 1:
+<pre>
+<strong>输入:</strong> arr = [1,2,3,10,4,2,3,5]
+<strong>输出:</strong> 3
+<strong>解释:</strong> 我们需要删除的最短子数组是 [10,4,2] ，长度为 3 。剩余元素形成非递减数组 [1,2,3,3,5] 。
+另一个正确的解为删除子数组 [3,10,4] 。
+</pre>
+
+#### 示例 2:
+<pre>
+<strong>输入:</strong> arr = [5,4,3,2,1]
+<strong>输出:</strong> 4
+<strong>解释:</strong> 由于数组是严格递减的，我们只能保留一个元素。所以我们需要删除长度为 4 的子数组，要么删除 [5,4,3,2]，要么删除 [4,3,2,1]。
+</pre>
+
+#### 示例 3:
+<pre>
+<strong>输入:</strong> arr = [1,2,3]
+<strong>输出:</strong> 0
+<strong>解释:</strong> 数组已经是非递减的了，我们不需要删除任何元素。
+</pre>
+
+#### 示例 4:
+<pre>
+<strong>输入:</strong> arr = [1]
+<strong>输出:</strong> 0
+</pre>
+
+#### 提示:
+* <code>1 <= arr.length <= 10<sup>5</sup></code>
+* <code>0 <= arr[i] <= 10<sup>9</sup></code>
+
+## 题解 (Rust)
+
+### 1. 题解
+```Rust
+impl Solution {
+    pub fn find_length_of_shortest_subarray(arr: Vec<i32>) -> i32 {
+        let mut arr = arr;
+        let mut i = arr.len();
+        let mut ret = arr.len() - 1;
+
+        arr.insert(0, 0);
+
+        while i > 0 && arr[i - 1] <= arr[i] {
+            i -= 1;
+        }
+
+        if i == 0 {
+            return 0;
+        }
+
+        for j in 0..arr.len() {
+            if j > 0 && arr[j - 1] > arr[j] {
+                break;
+            }
+
+            while i < arr.len() && arr[i] < arr[j] {
+                i += 1;
+            }
+
+            ret = ret.min(i - j - 1);
+        }
+
+        ret as i32
+    }
+}
+```
diff --git a/Problemset/1574-Shortest Subarray to be Removed to Make Array Sorted/Solution.rs b/Problemset/1574-Shortest Subarray to be Removed to Make Array Sorted/Solution.rs
@@ -0,0 +1,31 @@
+impl Solution {
+    pub fn find_length_of_shortest_subarray(arr: Vec<i32>) -> i32 {
+        let mut arr = arr;
+        let mut i = arr.len();
+        let mut ret = arr.len() - 1;
+
+        arr.insert(0, 0);
+
+        while i > 0 && arr[i - 1] <= arr[i] {
+            i -= 1;
+        }
+
+        if i == 0 {
+            return 0;
+        }
+
+        for j in 0..arr.len() {
+            if j > 0 && arr[j - 1] > arr[j] {
+                break;
+            }
+
+            while i < arr.len() && arr[i] < arr[j] {
+                i += 1;
+            }
+
+            ret = ret.min(i - j - 1);
+        }
+
+        ret as i32
+    }
+}
diff --git a/README.md b/README.md
@@ -838,6 +838,7 @@
 [1567][1567l]|[Maximum Length of Subarray With Positive Product][1567]                              |![rs]
 [1572][1572l]|[Matrix Diagonal Sum][1572]                                                           |![rs]
 [1573][1573l]|[Number of Ways to Split a String][1573]                                              |![rs]
+[1574][1574l]|[Shortest Subarray to be Removed to Make Array Sorted][1574]                          |![rs]
 [1576][1576l]|[Replace All ?'s to Avoid Consecutive Repeating Characters][1576]                     |![rs]
 [1577][1577l]|[Number of Ways Where Square of Number Is Equal to Product of Two Numbers][1577]      |![py]
 [1578][1578l]|[Minimum Time to Make Rope Colorful][1578]                                            |![rs]
@@ -2127,6 +2128,7 @@
 [1567]:Problemset/1567-Maximum%20Length%20of%20Subarray%20With%20Positive%20Product/README.md#1567-maximum-length-of-subarray-with-positive-product
 [1572]:Problemset/1572-Matrix%20Diagonal%20Sum/README.md#1572-matrix-diagonal-sum
 [1573]:Problemset/1573-Number%20of%20Ways%20to%20Split%20a%20String/README.md#1573-number-of-ways-to-split-a-string
+[1574]:Problemset/1574-Shortest%20Subarray%20to%20be%20Removed%20to%20Make%20Array%20Sorted/README.md#1574-shortest-subarray-to-be-removed-to-make-array-sorted
 [1576]:Problemset/1576-Replace%20All%20%3F's%20to%20Avoid%20Consecutive%20Repeating%20Characters/README.md#1576-replace-all-s-to-avoid-consecutive-repeating-characters
 [1577]:Problemset/1577-Number%20of%20Ways%20Where%20Square%20of%20Number%20Is%20Equal%20to%20Product%20of%20Two%20Numbers/README.md#1577-number-of-ways-where-square-of-number-is-equal-to-product-of-two-numbers
 [1578]:Problemset/1578-Minimum%20Time%20to%20Make%20Rope%20Colorful/README.md#1578-minimum-time-to-make-rope-colorful
@@ -3419,6 +3421,7 @@
 [1567l]:https://leetcode.com/problems/maximum-length-of-subarray-with-positive-product/
 [1572l]:https://leetcode.com/problems/matrix-diagonal-sum/
 [1573l]:https://leetcode.com/problems/number-of-ways-to-split-a-string/
+[1574l]:https://leetcode.com/problems/shortest-subarray-to-be-removed-to-make-array-sorted/
 [1576l]:https://leetcode.com/problems/replace-all-s-to-avoid-consecutive-repeating-characters/
 [1577l]:https://leetcode.com/problems/number-of-ways-where-square-of-number-is-equal-to-product-of-two-numbers/
 [1578l]:https://leetcode.com/problems/minimum-time-to-make-rope-colorful/
diff --git a/README_CN.md b/README_CN.md
@@ -838,6 +838,7 @@
 [1567][1567l]|[乘积为正数的最长子数组长度][1567]                        |![rs]
 [1572][1572l]|[矩阵对角线元素的和][1572]                                |![rs]
 [1573][1573l]|[分割字符串的方案数][1573]                                |![rs]
+[1574][1574l]|[删除最短的子数组使剩余数组有序][1574]                    |![rs]
 [1576][1576l]|[替换所有的问号][1576]                                    |![rs]
 [1577][1577l]|[数的平方等于两数乘积的方法数][1577]                      |![py]
 [1578][1578l]|[使绳子变成彩色的最短时间][1578]                          |![rs]
@@ -2127,6 +2128,7 @@
 [1567]:Problemset/1567-Maximum%20Length%20of%20Subarray%20With%20Positive%20Product/README_CN.md#1567-乘积为正数的最长子数组长度
 [1572]:Problemset/1572-Matrix%20Diagonal%20Sum/README_CN.md#1572-矩阵对角线元素的和
 [1573]:Problemset/1573-Number%20of%20Ways%20to%20Split%20a%20String/README_CN.md#1573-分割字符串的方案数
+[1574]:Problemset/1574-Shortest%20Subarray%20to%20be%20Removed%20to%20Make%20Array%20Sorted/README_CN.md#1574-删除最短的子数组使剩余数组有序
 [1576]:Problemset/1576-Replace%20All%20%3F's%20to%20Avoid%20Consecutive%20Repeating%20Characters/README_CN.md#1576-替换所有的问号
 [1577]:Problemset/1577-Number%20of%20Ways%20Where%20Square%20of%20Number%20Is%20Equal%20to%20Product%20of%20Two%20Numbers/README_CN.md#1577-数的平方等于两数乘积的方法数
 [1578]:Problemset/1578-Minimum%20Time%20to%20Make%20Rope%20Colorful/README_CN.md#1578-使绳子变成彩色的最短时间
@@ -3419,6 +3421,7 @@
 [1567l]:https://leetcode.cn/problems/maximum-length-of-subarray-with-positive-product/
 [1572l]:https://leetcode.cn/problems/matrix-diagonal-sum/
 [1573l]:https://leetcode.cn/problems/number-of-ways-to-split-a-string/
+[1574l]:https://leetcode.cn/problems/shortest-subarray-to-be-removed-to-make-array-sorted/
 [1576l]:https://leetcode.cn/problems/replace-all-s-to-avoid-consecutive-repeating-characters/
 [1577l]:https://leetcode.cn/problems/number-of-ways-where-square-of-number-is-equal-to-product-of-two-numbers/
 [1578l]:https://leetcode.cn/problems/minimum-time-to-make-rope-colorful/
