class Solution {
    public int smallestRangeI(int[] nums, int k) {
        int max=nums[0], min=nums[0];
        for(int n:nums){
            max = Math.max(max, n);
            min = Math.min(min, n);
        }
        return Math.max(max-min-2*k, 0); 
    }
}