0908._Smallest_Range.md

908. Smallest Range

难度: Easy

刷题内容

原题连接

• https://leetcode.com/problems/smallest-range-i/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

解题方案

思路 1 - 时间复杂度: O(N)- 空间复杂度: O(1)******

比赛起晚了，9点25惊醒，看到题目后 3 分钟多一点 bug free 一遍 AC

这个题目这么简单就没必要说什么了

class Solution(object):
    def smallestRangeI(self, A, K):
        """
        :type A: List[int]
        :type K: int
        :rtype: int
        """
        max_num = max(A)
        min_num = min(A)
        if max_num - min_num > 2 * abs(K):
            return max_num - min_num - 2 * abs(K)
        elif max_num - min_num <= 2 * abs(K):
            return 0