该题要求通过给定的整数数组nums和整数k，找到使得数组中最大值与最小值之差最小的操作方案。思路包括排序、找到转折点以及确定转折点后的分段极值。通过闭眼想象平面直角坐标系来辅助理解问题，最终得出解决方案。需要注意转折点可能不存在的情况。
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 <
最低0.47元/天 解锁文章
764
被折叠的 条评论
为什么被折叠?
到【灌水乐园】发言
