Smallest Range II

class Solution:
    def smallestRangeII(self, nums, k):
        nums.sort()
        out = nums[-1] - nums[0]
        N = len(nums)
        for ix in range(N - 1):
	        _max = max(nums[-1] - k, nums[ix] + k)
	        _min = min(nums[1 + ix] - k, nums[0] + k)
            out = min(out, _max - _min)
        return out