LeetCode in Kotlin
910. Smallest Range II
Medium
You are given an integer array nums and an integer k.
For each index i where 0 <= i < nums.length, change nums[i] to be either nums[i] + k or nums[i] - k.
The score of nums is the difference between the maximum and minimum elements in nums.
Return the minimum score of nums after changing the values at each index.
Example 1:
Input: nums = [1], k = 0
Output: 0
Explanation: The score is max(nums) - min(nums) = 1 - 1 = 0.
Example 2:
Input: nums = [0,10], k = 2
Output: 6
Explanation: Change nums to be [2, 8]. The score is max(nums) - min(nums) = 8 - 2 = 6.
Example 3:
Input: nums = [1,3,6], k = 3
Output: 3
Explanation: Change nums to be [4, 6, 3]. The score is max(nums) - min(nums) = 6 - 3 = 3.
Constraints:
1 <= nums.length <= 1040 <= nums[i] <= 1040 <= k <= 104
Solution
class Solution {
fun smallestRangeII(nums: IntArray, k: Int): Int {
nums.sort()
val n = nums.size
var ans = nums[n - 1] - nums[0]
val min = nums[0] + k
val max = nums[n - 1] - k
for (i in 0 until n - 1) {
val mx = max.coerceAtLeast(nums[i] + k)
val mi = min.coerceAtMost(nums[i + 1] - k)
ans = ans.coerceAtMost(mx - mi)
}
return ans
}
}