1
class Solution {
2
  public int smallestRangeI(int[] nums, int k) {
3
    if (nums.length == 1) return 0;
4

5
    int min = Integer.MAX_VALUE;
6
    int max = Integer.MIN_VALUE;
7

8
    for (int num : nums) {
9
      min = Math.min(min, num);
10
      max = Math.max(max, num);
11
    }
12
    int diff = max - min;
13

14
    return Math.max(0, diff - 2 * k);
15
  }
16
}