[LeetCode] Problem 908 - Smallest Range I

Posted on | In ,

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].

After this process, we have some array B.

Return the smallest possible difference between the maximum value of B and the minimum value of B.

Example

No.1

Input: A = [1], K = 0

Output: 0

Explanation: B = [1]

No.2

Input: A = [0,10], K = 2

Output: 6

Explanation: B = [2,8]

No.3

Input: A = [1,3,6], K = 3

Output: 0

Explanation: B = [3,3,3] or B = [4,4,4]

Note

  1. 1 <= A.length <= 10000
  2. 0 <= A[i] <= 10000
  3. 0 <= K <= 10000

Code

1
2
3
4
5
6
7
8
9
10
11
public int smallestRangeI(int[] A, int K) {
    int min = Integer.MAX_VALUE;
    int max = Integer.MIN_VALUE;
    
    for (int a : A) {
        min = Math.min(min, a);
        max = Math.max(max, a);
    }
    
    return Math.max(max - min - 2 * K, 0);
}