class Solution {
public:
int smallestRangeI(vector<int>& A, int K) {
sort(A.begin(),A.end(),less<int>());
if(A.front()+K>=A.back()-K){
return 0;
}else{
return (A.back()-K)-(A.front()+K);
}
}
};
LeetCode908.最小差值
最新推荐文章于 2022-04-30 19:03:22 发布