Leetcode 908. Smallest Range I

class Solution:
    def smallestRangeI(self, A: List[int], K: int) -> int:
        return max(max(max(A)-K,0)-(min(A)+K),0)