908. Smallest Range I

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.

class Solution {
public:
    int smallestRangeI(vector<int>& A, int K) {
        int max = A[0],min = A[0];
        for(int n:A){
            if(n > max)
                max = n;
            if(n < min)
                min = n;
        }
        int res = max - min - 2*K;
        res = res < 0 ? 0:res;
        return res;
    }
};