2009. Minimum Number of Operations to Make Array Continuous: RETRY

Author: tan-wei

src/solution/mod.rs

@@ -1514,3 +1514,4 @@ mod s2003_smallest_missing_genetic_value_in_each_subtree;
 mod s2006_count_number_of_pairs_with_absolute_difference_k;
 mod s2007_find_original_array_from_doubled_array;
 mod s2008_maximum_earnings_from_taxi;
+mod s2009_minimum_number_of_operations_to_make_array_continuous;

src/solution/s2009_minimum_number_of_operations_to_make_array_continuous.rs

@@ -0,0 +1,91 @@
+/**
+ * [2009] Minimum Number of Operations to Make Array Continuous
+ *
+ * You are given an integer array nums. In one operation, you can replace any element in nums with any integer.
+ * nums is considered continuous if both of the following conditions are fulfilled:
+ *
+ * 	All elements in nums are unique.
+ * 	The difference between the maximum element and the minimum element in nums equals nums.length - 1.
+ *
+ * For example, nums = [4, 2, 5, 3] is continuous, but nums = [1, 2, 3, 5, 6] is not continuous.
+ * Return the minimum number of operations to make nums continuous.
+ *  
+ * Example 1:
+ *
+ * Input: nums = [4,2,5,3]
+ * Output: 0
+ * Explanation: nums is already continuous.
+ *
+ * Example 2:
+ *
+ * Input: nums = [1,2,3,5,6]
+ * Output: 1
+ * Explanation: One possible solution is to change the last element to 4.
+ * The resulting array is [1,2,3,5,4], which is continuous.
+ *
+ * Example 3:
+ *
+ * Input: nums = [1,10,100,1000]
+ * Output: 3
+ * Explanation: One possible solution is to:
+ * - Change the second element to 2.
+ * - Change the third element to 3.
+ * - Change the fourth element to 4.
+ * The resulting array is [1,2,3,4], which is continuous.
+ *
+ *  
+ * Constraints:
+ *
+ * 	1 <= nums.length <= 10^5
+ * 	1 <= nums[i] <= 10^9
+ *
+ */
+pub struct Solution {}
+
+// problem: https://leetcode.com/problems/minimum-number-of-operations-to-make-array-continuous/
+// discuss: https://leetcode.com/problems/minimum-number-of-operations-to-make-array-continuous/discuss/?currentPage=1&orderBy=most_votes&query=
+
+// submission codes start here
+
+impl Solution {
+    pub fn min_operations(nums: Vec<i32>) -> i32 {
+        0
+    }
+}
+
+// submission codes end
+
+#[cfg(test)]
+mod tests {
+    use super::*;
+
+    #[test]
+    #[ignore]
+    fn test_2009_example_1() {
+        let nums = vec![4, 2, 5, 3];
+
+        let result = 0;
+
+        assert_eq!(Solution::min_operations(nums), result);
+    }
+
+    #[test]
+    #[ignore]
+    fn test_2009_example_2() {
+        let nums = vec![1, 2, 3, 5, 6];
+
+        let result = 1;
+
+        assert_eq!(Solution::min_operations(nums), result);
+    }
+
+    #[test]
+    #[ignore]
+    fn test_2009_example_3() {
+        let nums = vec![1, 10, 100, 1000];
+
+        let result = 3;
+
+        assert_eq!(Solution::min_operations(nums), result);
+    }
+}