910. Smallest Range II

Problem Link

Description

---

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

For each index i where 0 <= i < nums.length, change nums[i] to be either nums[i] + k or nums[i] - k.

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

Return the minimum score of nums after changing the values at each index.

 

Example 1:

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

Example 2:

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:

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

 

Constraints:

• 1 <= nums.length <= 104
• 0 <= nums[i] <= 104
• 0 <= k <= 104

Solution

---

Python3

class Solution:
    def smallestRangeII(self, A: List[int], K: int) -> int:
        A.sort()
        
        res = A[-1] - A[0]
        
        for i in range(len(A) - 1):
            maxi = max(A[i] + K, A[-1] - K)
            mini = min(A[0] + K, A[i+1] - K)
            
            res = min(res, maxi - mini)
        
        return res