【Leetcode_easy】908. Smallest Range I

problem

908. Smallest Range I

solution:

class Solution {
public:
    int smallestRangeI(vector<int>& A, int K) {
        int mx = A[], mn = A[];
        for(auto a:A) { mx = max(mx, a); mn = min(mn, a); }
        return max(, mx-mn-*K);
    }
};

参考

1. Leetcode_easy_908. Smallest Range I;

2. discuss;

完