human
I found an interesting problem on https://leetcode.com/problems/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 <= A.length <= 10000
0 <= A[i] <= 10000
0 <= K <= 10000

I tried it in Python, but could not do it. Can you solve it?
assistant
#Here is the Python program you requested.

class Solution:
    def smallestRangeII(self, A: List[int], K: int) -> int:
        
        A.sort()
        
        min_diff=A[-1]-A[0]
        
        for i in range(len(A)-1):
            #vs=[A[0]+K,A[i]+K,A[i+1]-K,A[-1]-K]
            
            v_min=min(A[0]+K,A[i+1]-K)
            v_max=max(A[i]+K,A[-1]-K)
            
            min_diff=min(min_diff,max(v_min,v_max)-min(v_min,v_max))
            
            
        return min_diff