LeetCode 910. 最小差值 II（贪心）

示例 1：
输入：A = [1], K = 0
输出：0
解释：B = [1]

示例 2：
输入：A = [0,10], K = 2
输出：6
解释：B = [2,8]

示例 3：
输入：A = [1,3,6], K = 3
输出：3
解释：B = [4,6,3]
 
提示：
1 <= A.length <= 10000
0 <= A[i] <= 10000
0 <= K <= 10000

class Solution { // c++
public:
    int smallestRangeII(vector<int>& A, int K) {
    	sort(A.begin(), A.end());
    	int i, n = A.size(), up, down;
    	int mindis = INT_MAX;
    	for(i = 0; i < n-1; i++)
    	{
    		up = max(A[i]+K, A[n-1]-K);
    		down = min(A[0]+K, A[i+1]-K);
    		mindis = min(mindis, up-down);
    	}
    	return min(mindis, A[n-1]-A[0]);//第二种情况为同侧偏置
    }
};

class Solution: # py3
    def smallestRangeII(self, A: List[int], K: int) -> int:
        A.sort()
        mindis = float("inf")
        n = len(A)
        for i in range(n-1):
            up = max(A[i]+K, A[n-1]-K)
            down = min(A[0]+K, A[i+1]-K)
            mindis = min(mindis, up-down)
        return min(mindis, A[n-1]-A[0])# 第二种情况为同侧偏置