class Solution(object):
def smallestRangeI(self, A, K):
"""
:type A: List[int]
:type K: int
:rtype: int
"""
m = max(A) - K
n = min(A) + K
if m <= n:
return 0
return m - n
leetcode - 908 - 最小差值 I
最新推荐文章于 2022-04-30 09:47:51 发布
class Solution(object):
def smallestRangeI(self, A, K):
"""
:type A: List[int]
:type K: int
:rtype: int
"""
m = max(A) - K
n = min(A) + K
if m <= n:
return 0
return m - n