#910

Smallest Range II

expert · 1060 · lc medium +32 · verified · 37.8% accepted · 1,713 likes · top 16%

Description

Given an integer array nums and an integer k, transform each element by either adding k or subtracting k. The score of the transformed array is its maximum minus its minimum. Return the smallest achievable score.

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.

Code

1

2

3

class Solution:
    def smallestRangeII(self, nums: List[int], k: int) -> int:

class Solution:
    def smallestRangeII(self, nums: List[int], k: int) -> int: