1906. Minimum Absolute Difference Queries: RETRY

Author: tan-wei

src/solution/mod.rs

@@ -1437,3 +1437,4 @@ mod s1901_find_a_peak_element_ii;
 mod s1903_largest_odd_number_in_string;
 mod s1904_the_number_of_full_rounds_you_have_played;
 mod s1905_count_sub_islands;
+mod s1906_minimum_absolute_difference_queries;

src/solution/s1906_minimum_absolute_difference_queries.rs

@@ -0,0 +1,87 @@
+/**
+ * [1906] Minimum Absolute Difference Queries
+ *
+ * The minimum absolute difference of an array a is defined as the minimum value of |a[i] - a[j]|, where 0 <= i < j < a.length and a[i] != a[j]. If all elements of a are the same, the minimum absolute difference is -1.
+ *
+ * 	For example, the minimum absolute difference of the array [5,<u>2</u>,<u>3</u>,7,2] is |2 - 3| = 1. Note that it is not 0 because a[i] and a[j] must be different.
+ *
+ * You are given an integer array nums and the array queries where queries[i] = [li, ri]. For each query i, compute the minimum absolute difference of the subarray nums[li...ri] containing the elements of nums between the 0-based indices li and ri (inclusive).
+ * Return an array ans where ans[i] is the answer to the i^th query.
+ * A subarray is a contiguous sequence of elements in an array.
+ * The value of |x| is defined as:
+ *
+ * 	x if x >= 0.
+ * 	-x if x < 0.
+ *
+ *  
+ * Example 1:
+ *
+ * Input: nums = [1,3,4,8], queries = [[0,1],[1,2],[2,3],[0,3]]
+ * Output: [2,1,4,1]
+ * Explanation: The queries are processed as follows:
+ * - queries[0] = [0,1]: The subarray is [<u>1</u>,<u>3</u>] and the minimum absolute difference is |1-3| = 2.
+ * - queries[1] = [1,2]: The subarray is [<u>3</u>,<u>4</u>] and the minimum absolute difference is |3-4| = 1.
+ * - queries[2] = [2,3]: The subarray is [<u>4</u>,<u>8</u>] and the minimum absolute difference is |4-8| = 4.
+ * - queries[3] = [0,3]: The subarray is [1,<u>3</u>,<u>4</u>,8] and the minimum absolute difference is |3-4| = 1.
+ *
+ * Example 2:
+ *
+ * Input: nums = [4,5,2,2,7,10], queries = [[2,3],[0,2],[0,5],[3,5]]
+ * Output: [-1,1,1,3]
+ * Explanation: The queries are processed as follows:
+ * - queries[0] = [2,3]: The subarray is [2,2] and the minimum absolute difference is -1 because all the
+ *   elements are the same.
+ * - queries[1] = [0,2]: The subarray is [<u>4</u>,<u>5</u>,2] and the minimum absolute difference is |4-5| = 1.
+ * - queries[2] = [0,5]: The subarray is [<u>4</u>,<u>5</u>,2,2,7,10] and the minimum absolute difference is |4-5| = 1.
+ * - queries[3] = [3,5]: The subarray is [2,<u>7</u>,<u>10</u>] and the minimum absolute difference is |7-10| = 3.
+ *
+ *  
+ * Constraints:
+ *
+ * 	2 <= nums.length <= 10^5
+ * 	1 <= nums[i] <= 100
+ * 	1 <= queries.length <= 2 * 10^4
+ * 	0 <= li < ri < nums.length
+ *
+ */
+pub struct Solution {}
+
+// problem: https://leetcode.com/problems/minimum-absolute-difference-queries/
+// discuss: https://leetcode.com/problems/minimum-absolute-difference-queries/discuss/?currentPage=1&orderBy=most_votes&query=
+
+// submission codes start here
+
+impl Solution {
+    pub fn min_difference(nums: Vec<i32>, queries: Vec<Vec<i32>>) -> Vec<i32> {
+        vec![]
+    }
+}
+
+// submission codes end
+
+#[cfg(test)]
+mod tests {
+    use super::*;
+
+    #[test]
+    #[ignore]
+    fn test_1906_example_1() {
+        let nums = vec![4, 5, 2, 2, 7, 10];
+        let queries = vec![vec![2, 3], vec![0, 2], vec![0, 5], vec![3, 5]];
+
+        let result = vec![2, 1, 4, 1];
+
+        assert_eq!(Solution::min_difference(nums, queries), result);
+    }
+
+    #[test]
+    #[ignore]
+    fn test_1906_example_2() {
+        let nums = vec![4, 5, 2, 2, 7, 10];
+        let queries = vec![vec![2, 3], vec![0, 2], vec![0, 5], vec![3, 5]];
+
+        let result = vec![-1, 1, 1, 3];
+
+        assert_eq!(Solution::min_difference(nums, queries), result);
+    }
+}