minimum-absolute-difference-between-elements-with-constraint

java

python

python3

mysql

mssql

oraclesql

csharp

javascript

typescript

bash

swift

kotlin

dart

golang

ruby

scala

rust

racket

erlang

elixir

pythondata

postgresql

cangjie

Algorithms

You are given a 0-indexed integer array <code>nums</code> and an integer <code>x</code>.

Find the minimum absolute difference between two elements in the array that are at least <code>x</code> indices apart.

In other words, find two indices <code>i</code> and <code>j</code> such that <code>abs(i - j) &gt;= x</code> and <code>abs(nums[i] - nums[j])</code> is minimized.

Return an integer denoting the minimum absolute difference between two elements that are at least <code>x</code> indices apart.

&nbsp;
Example 1:

<pre>
Input: nums = [4,3,2,4], x = 2
Output: 0
Explanation: We can select nums[0] = 4 and nums[3] = 4. 
They are at least 2 indices apart, and their absolute difference is the minimum, 0. 
It can be shown that 0 is the optimal answer.
</pre>

Example 2:

<pre>
Input: nums = [5,3,2,10,15], x = 1
Output: 1
Explanation: We can select nums[1] = 3 and nums[2] = 2.
They are at least 1 index apart, and their absolute difference is the minimum, 1.
It can be shown that 1 is the optimal answer.
</pre>

Example 3:

<pre>
Input: nums = [1,2,3,4], x = 3
Output: 3
Explanation: We can select nums[0] = 1 and nums[3] = 4.
They are at least 3 indices apart, and their absolute difference is the minimum, 3.
It can be shown that 3 is the optimal answer.
</pre>

&nbsp;
Constraints:

<ul>
	<li><code>1 &lt;= nums.length &lt;= 105</code></li>
	<li><code>1 &lt;= nums[i] &lt;= 109</code></li>
	<li><code>0 &lt;= x &lt; nums.length</code></li>
</ul>

minAbsoluteDifference

Minimum Absolute Difference Between Elements With Constraint

K-diff Pairs in an Array

k-diff-pairs-in-an-array

数组中的 k-diff 数对

Find All K-Distant Indices in an Array

find-all-k-distant-indices-in-an-array

找出数组中的所有 K 近邻下标

Find Indices With Index and Value Difference I

find-indices-with-index-and-value-difference-i

找出满足差值条件的下标 I

Find Indices With Index and Value Difference II

find-indices-with-index-and-value-difference-ii

找出满足差值条件的下标 II

Array

Binary Search

Ordered Set

给你一个下标从 0&nbsp;开始的整数数组&nbsp;<code>nums</code>&nbsp;和一个整数&nbsp;<code>x</code>&nbsp;。

请你找到数组中下标距离至少为 <code>x</code>&nbsp;的两个元素的 差值绝对值&nbsp;的 最小值&nbsp;。

换言之，请你找到两个下标&nbsp;<code>i</code> 和&nbsp;<code>j</code>&nbsp;，满足&nbsp;<code>abs(i - j) &gt;= x</code> 且&nbsp;<code>abs(nums[i] - nums[j])</code>&nbsp;的值最小。

请你返回一个整数，表示下标距离至少为 <code>x</code>&nbsp;的两个元素之间的差值绝对值的 最小值&nbsp;。

&nbsp;

示例 1：

<pre>
输入：nums = [4,3,2,4], x = 2
输出：0
解释：我们选择 nums[0] = 4 和 nums[3] = 4 。
它们下标距离满足至少为 2 ，差值绝对值为最小值 0 。
0 是最优解。
</pre>

示例 2：

<pre>
输入：nums = [5,3,2,10,15], x = 1
输出：1
解释：我们选择 nums[1] = 3 和 nums[2] = 2 。
它们下标距离满足至少为 1 ，差值绝对值为最小值 1 。
1 是最优解。
</pre>

示例 3：

<pre>
输入：nums = [1,2,3,4], x = 3
输出：3
解释：我们选择 nums[0] = 1 和 nums[3] = 4 。
它们下标距离满足至少为 3 ，差值绝对值为最小值 3 。
3 是最优解。
</pre>

&nbsp;

提示：

<ul>
	<li><code>1 &lt;= nums.length &lt;= 105</code></li>
	<li><code>1 &lt;= nums[i] &lt;= 109</code></li>
	<li><code>0 &lt;= x &lt; nums.length</code></li>
</ul>