Leetcode 908: Smallest Range

问题描述：
You are given an integer array nums and an integer k.

In one operation, you can choose any index i where 0 <= i < nums.length and change nums[i] to nums[i] + x where x is an integer from the range [-k, k]. You can apply this operation at most once for each index i.

The score of nums is the difference between the maximum and minimum elements in nums.

Return the minimum score of nums after applying the mentioned operation at most once for each index in it.

解释说明：
给定一个num数组，和整数k。数组中的每一个数均可变动，变动幅度是±k 。每次操作每一个数均可变动但只能变动一次。求操作过后极大值与极小值的差

思路：
我们只考虑极端情况，如果最小值+k可以追上最大值-k，则一次操作后可以拉平所有值 。 如果最大-最小>2k，则差值为 (max-min)-2k;
当然，前提是我们找出数组中的最值

代码如下：

class Solution {
    public int smallestRangeI(int[] nums, int k) {
        int min=nums[0];
        int max=nums[0];
        for(int i=1; i<nums.length; i++){
            if(nums[i]<min)  min=nums[i];
            else if(nums[i]>max)  max=nums[i];
        }
        if((max-min)<=2*k){
            return 0;
        }
        else{
            return (max-min)-2*k;
        }
    }
}

时间复杂度: O(n)