Smallest Range I

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 minimumscoreofnumsafter applying the mentioned operation at most once for each index in it.

LeetCode Problem - 908

class Solution {
    public int smallestRangeI(int[] nums, int k) {
        // Sort the array to easily access the smallest and largest elements
        Arrays.sort(nums);

        // Get the smallest and largest elements after sorting
        int firstIdx = nums[0];
        int lastIdx = nums[nums.length-1];

        // Initialize flag to store the minimum possible difference
        int flag = Integer.MAX_VALUE;

        // Iterate k+1 times to try to reduce the difference between the smallest and largest elements
        for(int i=0; i<k+1; i++){
            // Calculate the current difference between the largest and smallest elements
            int diff = lastIdx - firstIdx;

            // If the difference becomes negative, return 0 (as difference cannot be negative)
            if(diff < 0) {
                return 0;
            }

            // Update the minimum difference found so far
            if(diff < flag){
                flag = diff;
            }

            // Move towards reducing the difference further by incrementing the smallest
            // element and decrementing the largest element
            firstIdx++;
            lastIdx--;
        }

        // Return the smallest difference found
        return flag;
    }
}