smallest-range-i

java

python3

python

javascript

typescript

csharp

golang

kotlin

swift

rust

ruby

dart

scala

elixir

erlang

racket

bash

mysql

mssql

postgresql

oraclesql

pythondata

Algorithms

You are given an integer array <code>nums</code> and an integer <code>k</code>.

In one operation, you can choose any index <code>i</code> where <code>0 &lt;= i &lt; nums.length</code> and change <code>nums[i]</code> to <code>nums[i] + x</code> where <code>x</code> is an integer from the range <code>[-k, k]</code>. You can apply this operation at most once for each index <code>i</code>.

The score of <code>nums</code> is the difference between the maximum and minimum elements in <code>nums</code>.

Return the minimum score of <code>nums</code> after applying the mentioned operation at most once for each index in it.

&nbsp;
Example 1:

<pre>
Input: nums = [1], k = 0
Output: 0
Explanation: The score is max(nums) - min(nums) = 1 - 1 = 0.
</pre>

Example 2:

<pre>
Input: nums = [0,10], k = 2
Output: 6
Explanation: Change nums to be [2, 8]. The score is max(nums) - min(nums) = 8 - 2 = 6.
</pre>

Example 3:

<pre>
Input: nums = [1,3,6], k = 3
Output: 0
Explanation: Change nums to be [4, 4, 4]. The score is max(nums) - min(nums) = 4 - 4 = 0.
</pre>

&nbsp;
Constraints:

<ul>
	<li><code>1 &lt;= nums.length &lt;= 104</code></li>
	<li><code>0 &lt;= nums[i] &lt;= 104</code></li>
	<li><code>0 &lt;= k &lt;= 104</code></li>
</ul>