Description
Given an array A of integers, for each integer A[i] we may choose any x with -K <= x <= K, and add x to A[i].
After this process, we have some array B.
Return the smallest possible difference between the maximum value of B and the minimum value of B.
Example 1:
Input: A = [1], K = 0
Output: 0
Explanation: B = [1]
Example 2:
Input: A = [0,10], K = 2
Output: 6
Explanation: B = [2,8]
Example 3:
Input: A = [1,3,6], K = 3
Output: 0
Explanation: B = [3,3,3] or B = [4,4,4]
Note:
- 1 <= A.length <= 10000
- 0 <= A[i] <= 10000
- 0 <= K <= 10000
分析
题目的意思是:给定一个数组,没个数可以加或者减[-K,K]之间的任何数,求数组通过该操作以后的最大值和最小值之差最小。很直观差值最小为0,然后我们找出其中的最大值减去K,最小值加上K,如果小于0,则结果为0;如果大于0,则该值为最小差值了。其他情况就不用考虑了,只需要考虑这种极端情况。
代码
class Solution:
def smallestRangeI(self, A: List[int], K: int) -> int:
max_val=max(A)
min_val=min(A)
return max(0,(max_val-K)-(min_val+K))