class Solution {
public:
int smallestRangeI(vector<int>& A, int K) {
int N = A.size();
int mx = INT_MIN;
int mn = INT_MAX;
for(int i=0;i<N;i++){
mx = max(mx,A[i]);
mn = min(mn,A[i]);
}
return max(0,mx-mn-K*2);
}
};
No.101 - LeetCode908
最新推荐文章于 2021-09-13 16:49:45 发布