【leetcode】最小差值 I

int smallestRangeI(int* A, int ASize, int K){
    int min = A[0];
    int max = A[0];
    for (int i = 0; i < ASize; i++)
    {
        if (A[i] < min)min = A[i];
        else if (A[i] > max)max = A[i];
    }
    return (max - min > 2 * K) ? max - min - 2 * K : 0;
}