Class Solution
- java.lang.Object
-
- g0901_1000.s0910_smallest_range_ii.Solution
-
public class Solution extends Object
910 - Smallest Range II.Medium
You are given an integer array
nums
and an integerk
.For each index
i
where0 <= i < nums.length
, changenums[i]
to be eithernums[i] + k
ornums[i] - k
.The score of
nums
is the difference between the maximum and minimum elements innums
.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
-
-
Constructor Summary
Constructors Constructor Description Solution()
-
Method Summary
All Methods Instance Methods Concrete Methods Modifier and Type Method Description int
smallestRangeII(int[] nums, int k)
-