[LeetCode] 910. Smallest Range II 最小区间之二

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

Github 同步地址:

https://github.com/grandyang/leetcode/issues/910

类似题目：

Smallest Range I

参考资料：

https://leetcode.com/problems/smallest-range-ii/

LeetCode All in One 题目讲解汇总(持续更新中...)

[LeetCode] 910. Smallest Range II 最小区间之二

原文：https://www.cnblogs.com/grandyang/p/11361245.html