# Smallest Range I Problem

## Description

LeetCode Problem 908.

You are given an integer array nums and an integer k.

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

The score of nums is the difference between the maximum and minimum elements in nums.

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

Example 1:

``````1
2
3
Input: nums = , k = 0
Output: 0
Explanation: The score is max(nums) - min(nums) = 1 - 1 = 0.
``````

Example 2:

``````1
2
3
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.
``````

Example 3:

``````1
2
3
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.
``````

Constraints:

• 1 <= nums.length <= 10^4
• 0 <= nums[i] <= 10^4
• 0 <= k <= 10^4

## Sample C++ Code

``````1
2
3
4
5
6
7
8
9
10
11
class Solution {
public:
int smallestRangeI(vector<int> A, int K) {
int mx = A, mn = A;
for (int a : A) {
mx = max(mx, a);
mn = min(mn, a);
}
return max(0, mx - mn - 2 * K);
}
};
``````