LeetCode刷题记录——第908题（最小差值）

题目描述

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]

思路分析

• 如果A中最大值和最小值的差小于两倍的K，那么说明可以通过值的调整来将最小的差控制到0
• 如果A中最大值和最小值的差大于两倍的K，那么通过对最小值加K，最大值减K来进行差值的调整

代码示例

class Solution(object):
    def smallestRangeI(self, A, K):
        """
        :type A: List[int]
        :type K: int
        :rtype: int
        """
        a = min(A)
        b = max(A)
        if b - a <= 2 * K:
            return 0
        else:
            return b - a - 2 * K

• 2019年3月23日 于燕园北 天朗气清，阳光正好，适合出游