class Solution: def minDifference(self , a ): # write code here set_tmp = set(a) if len(a) != len(set_tmp): return 0 else: a.sort() min_val = a[1] - a[0] for i in range(1, len(a)-1): if a[i+1] - a[i] < min_val: min_val = a[i+1] - a[i] else: continue return min_val
三步走:
# # 代码中的类名、方法名、参数名已经指定,请勿修改,直接返回方法规定的值即可 # 求最小差值 # @param a int整型一维数组 数组a # @return int整型 # class Solution: def minDifference(self , a ): # write code here a = sorted(a) # 排序 import sys res = sys.maxsize # 获取一个 int 最大值 for i, e in enumerate(a): # 穷举比较 n = abs(a[i] - a[i - 1]) if n < res: res = n return res