| Run ID | 作者 | 问题 | 语言 | 测评结果 | Time | Memory | 代码长度 | 提交时间 |
|---|---|---|---|---|---|---|---|---|
| 134222 | 胡海峰老师 | 两个数的最小距离 | Python3 | Accepted | 55 MS | 3864 KB | 632 | 2025-10-26 09:25:17 |
# n = int(input()) # a = list(map(int,input().split())) # # dis = 10**8 # # for i in range(n): # # for j in range(n): # # if i!=j: # # d = abs( a[i] - a[j]) # # if d< dis: # # dis =d # # print(dis) # a.sort() # dis = a[1]-a[0] # for i in range(1,n-2): # # print( a[i+1]-a[i]) # if a[i+1]-a[i]< dis: # dis = a[i+1]-a[i] # print(dis) n = int(input()) a = list(map(int, input().split())) a.sort() min_dist = a[1]-a[0] for i in range(2, n): diff = a[i] - a[i - 1] if diff < min_dist: min_dist = diff print(min_dist)