int smallestRangeI(int* A, int ASize, int K){
int min, max;
min = max = A[0];
for(int i = 0; i < ASize; i++){
min = fmin(min, A[i]);
max = fmax(max, A[i]);
}
return fmax(0, max - min - 2 * K);
}
leetcode打卡51
最新推荐文章于 2022-11-12 12:02:37 发布