原题链接：908. 最小差值 I

solution:

class Solution {
public:
    int smallestRangeI(vector<int>& nums, int k) {
        int maxv = INT_MIN;
        int minv = INT_MAX;
        for(int i = 0;i < nums.size();i++){
            maxv = max(maxv,nums[i] - k);
            minv = min(minv,nums[i] + k);
        }
        return (maxv - minv) < 0? 0:maxv - minv;
    }
};