Package g1901_2000.s1906_minimum_absolute_difference_queries

Class Solution

java.lang.Object

g1901_2000.s1906_minimum_absolute_difference_queries.Solution

public class Solution
extends Object

1906 - Minimum Absolute Difference Queries.<p>Medium</p> <p>The <strong>minimum absolute difference</strong> of an array <code>a</code> is defined as the <strong>minimum value</strong> of <code>|a[i] - a[j]|</code>, where <code>0 <= i < j < a.length</code> and <code>a[i] != a[j]</code>. If all elements of <code>a</code> are the <strong>same</strong> , the minimum absolute difference is <code>-1</code>.</p> <ul> <li>For example, the minimum absolute difference of the array <code>[5,2,3,7,2]</code> is <code>|2 - 3| = 1</code>. Note that it is not <code>0</code> because <code>a[i]</code> and <code>a[j]</code> must be different.</li> </ul> <p>You are given an integer array <code>nums</code> and the array <code>queries</code> where <code>queries[i] = [l_i, r_i]</code>. For each query <code>i</code>, compute the <strong>minimum absolute difference</strong> of the <strong>subarray</strong> <code>nums[l_i&hellip;r_i]</code> containing the elements of <code>nums</code> between the <strong>0-based</strong> indices <code>l_i</code> and <code>r_i</code> ( <strong>inclusive</strong> ).</p> <p>Return <em>an <strong>array</strong></em> <code>ans</code> <em>where</em> <code>ans[i]</code> <em>is the answer to the</em> <code>i^th</code> <em>query</em>.</p> <p>A <strong>subarray</strong> is a contiguous sequence of elements in an array.</p> <p>The value of <code>|x|</code> is defined as:</p> <ul> <li><code>x</code> if <code>x >= 0</code>.</li> <li><code>-x</code> if <code>x < 0</code>.</li> </ul> <p><strong>Example 1:</strong></p> <p><strong>Input:</strong> nums = [1,3,4,8], queries = [[0,1],[1,2],[2,3],[0,3]]</p> <p><strong>Output:</strong> [2,1,4,1]</p> <p><strong>Explanation:</strong> The queries are processed as follows:</p> <ul> <li> <p>queries[0] = [0,1]: The subarray is [1,3] and the minimum absolute difference is |1-3| = 2.</p> </li> <li> <p>queries[1] = [1,2]: The subarray is [3,4] and the minimum absolute difference is |3-4| = 1.</p> </li> <li> <p>queries[2] = [2,3]: The subarray is [4,8] and the minimum absolute difference is |4-8| = 4.</p> </li> <li> <p>queries[3] = [0,3]: The subarray is [1,3,4,8] and the minimum absolute difference is |3-4| = 1.</p> </li> </ul> <p><strong>Example 2:</strong></p> <p><strong>Input:</strong> nums = [4,5,2,2,7,10], queries = [[2,3],[0,2],[0,5],[3,5]]</p> <p><strong>Output:</strong> [-1,1,1,3]</p> <p><strong>Explanation:</strong> The queries are processed as follows:</p> <ul> <li> <p>queries[0] = [2,3]: The subarray is [2,2] and the minimum absolute difference is -1 because all the elements are the same.</p> </li> <li> <p>queries[1] = [0,2]: The subarray is [4,5,2] and the minimum absolute difference is |4-5| = 1.</p> </li> <li> <p>queries[2] = [0,5]: The subarray is [4,5,2,2,7,10] and the minimum absolute difference is |4-5| = 1.</p> </li> <li> <p>queries[3] = [3,5]: The subarray is [2,7,10] and the minimum absolute difference is |7-10| = 3.</p> </li> </ul> <p><strong>Constraints:</strong></p> <ul> <li><code>2 <= nums.length <= 10⁵</code></li> <li><code>1 <= nums[i] <= 100</code></li> <li><code>1 <= queries.length <= 2 * 10⁴</code></li> <li><code>0 <= l_i < r_i < nums.length</code></li> </ul>

Constructor Summary

Constructors

Constructor	Description
Solution()

Method Summary

Modifier and Type	Method	Description
int[]	minDifference(int[] nums, int[][] queries)

Methods inherited from class java.lang.Object

clone, equals, finalize, getClass, hashCode, notify, notifyAll, toString, wait, wait, wait

Constructor Details

Solution

public Solution()

Method Details

minDifference

public int[] minDifference(int[] nums,
 int[][] queries)