solutions/0908-smallest-range-i.js

/**
 * 908. Smallest Range I
 * https://leetcode.com/problems/smallest-range-i/
 * Difficulty: Easy
 *
 * 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.
 */

/**
 * @param {number[]} nums
 * @param {number} k
 * @return {number}
 */
var smallestRangeI = function(nums, k) {
  return Math.max(Math.max(...nums) - Math.min(...nums) - 2 * k, 0);
};