[leetcode] 910. Smallest Range II

Description

Given an array A of integers, for each integer A[i] we need to choose either x = -K or x = K, and add x to A[i] (only once).

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: 3
Explanation: B = [4,6,3]

Note:

1. 1 <= A.length <= 10000
2. 0 <= A[i] <= 10000
3. 0 <= K <= 10000

分析

题目的意思是：给定一个数组，每个数可以加K，或者可以减K。对于排序好的数组A，如果 A[i] < A[j]，我们只需要考虑(A[i] + K, A[j] - K)的情况，其他情况求出来的差值肯定比这个大。那么最终我们只需要考虑 A[0] + K, A[i] + K, A[i+1] - K, A[- 1] - K 就是计算结果的唯一值。其中A[0]是数组的最小值，A[-1]是数组的最大值，弄懂了这个，然后遍历一遍就完了。

代码

class Solution:
    def smallestRangeII(self, A: List[int], K: int) -> int:
        A.sort()
        n=len(A)
        res=A[-1]-A[0]
        for i in range(n-1):
            t1=max(A[-1]-K,A[i]+K)
            t2=min(A[0]+K,A[i+1]-K)
            res=min(res,t1-t2)
        return res

参考文献

最小差值 II