1def smallestRangeII(nums, k):
2    nums.sort()
3    result = nums[-1] - nums[0]
4    for i in range(len(nums) - 1):
5        high = max(nums[i] + k, nums[-1] - k)
6        low = min(nums[0] + k, nums[i + 1] - k)
7        result = min(result, high - low)
8    return result
9
10nums = [1, 3, 6]
11k = 3
12print(smallestRangeII(nums, k))  # Output: 3

1using System;
2
public class SmallestRangeII {
    public int SmallestRange(int[] nums, int k) {
        Array.Sort(nums);
        int minVal = nums[0] + k;
        int maxVal = nums[nums.Length - 1] - k;
        int result = nums[nums.Length - 1] - nums[0];

        for (int i = 0; i < nums.Length - 1; i++) {
            int currentMax = Math.Max(nums[i] + k, maxVal);
            int currentMin = Math.Min(minVal, nums[i + 1] - k);
            result = Math.Min(result, currentMax - currentMin);
        }

        return result;
    }

    public static void Main(string[] args) {
        SmallestRangeII solution = new SmallestRangeII();
        int[] nums = {1, 3, 6};
        int k = 3;
        Console.WriteLine(solution.SmallestRange(nums, k));
    }
}