简单题重拳出击
class Solution {
public int smallestRangeI(int[] nums, int k) {
int min = nums[0];
int max = nums[0];
for(int i = 1; i < nums.length; i ++){
max = Math.max(max, nums[i]);
min = Math.min(min, nums[i]);
}
return Math.max(0, (max - min - k * 2));
}
}