SmallestRangeI.java

/* (C) 2024 YourCompanyName */
package math;

import java.util.*;

/**
 * Created by gouthamvidyapradhan on 22/08/2019 Given an array A of integers, for each integer A[i]
 * we may choose any x with -K <= x <= K, and add x to A[i].
 *
 * <p>After this process, we have some array B.
 *
 * <p>Return the smallest possible difference between the maximum value of B and the minimum value
 * of B.
 *
 * <p>Example 1:
 *
 * <p>Input: A = [1], K = 0 Output: 0 Explanation: B = [1] Example 2:
 *
 * <p>Input: A = [0,10], K = 2 Output: 6 Explanation: B = [2,8] Example 3:
 *
 * <p>Input: A = [1,3,6], K = 3 Output: 0 Explanation: B = [3,3,3] or B = [4,4,4]
 *
 * <p>Note:
 *
 * <p>1 <= A.length <= 10000 0 <= A[i] <= 10000 0 <= K <= 10000
 */
public class SmallestRangeI {
  public static void main(String[] args) {
    //
  }

  public int smallestRangeI(int[] A, int K) {
    Arrays.sort(A);
    if (A.length == 0 || A.length == 1) return 0;
    else {
      int low = A[0];
      int high = A[A.length - 1];
      int l = low + (K);
      int r = high - (K);
      if (r > l) return r - l;
      else return 0;
    }
  }
}