Package g0901_1000.s0910_smallest_range_ii

Class Solution

  • All Implemented Interfaces:
    
public final class Solution

    910 - Smallest Range II.

    Medium

    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:

    • <code>1 <= nums.length <= 10<sup>4</sup></code>

    • <code>0 <= numsi<= 10<sup>4</sup></code>

    • <code>0 <= k <= 10<sup>4</sup></code>

    • Nested Class Summary

      Nested Classes 
      Modifier and Type Class Description

    • Field Summary

      Fields 
      Modifier and Type Field Description

    • Constructor Summary

      Constructors 
      Constructor Description
      Solution()

    • Enum Constant Summary

      Enum Constants 
      Enum Constant Description

    • Method Summary

      Modifier and Type Method Description
      final Integer smallestRangeII(IntArray nums, Integer k)

      • Methods inherited from class java.lang.Object

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