【leetcode刷题】T179-最小差值 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]

class Solution(object):
    def smallestRangeII(self, A, K):
        """
        :type A: List[int]
        :type K: int
        :rtype: int
        """
        if len(A) == 0:
            return 0
        A.sort()
        res = A[-1] - A[0]
        if A[-1] - A[0] <= K:
            return res

        B = [i-K for i in A]
        max0 = A[0]
        min0 = A[-1]
        for i in range(len(A) - 1):
            B[i] += 2 * K
            max0 = max(B[-1], B[i])
            min0 = min(B[0], B[i+1])
            res = min(res, max0 - min0)
        return res

class Solution {
public:
    int smallestRangeII(vector<int>& A, int K) {
        sort(A.begin(), A.end());
        int res = A.back() - A[0];
        if(res <= K)
            return res;

        int max0, min0;
        for(int i=0; i < A.size()-1; i++){
            max0 = max(A[i] + K, A.back() - K);
            min0 = min(A[0] + K, A[i+1] - K);
            res = min(res, max0 - min0);
        }
        return res;
    }
};