| Run ID | 作者 | 问题 | 语言 | 测评结果 | Time | Memory | 代码长度 | 提交时间 |
|---|---|---|---|---|---|---|---|---|
| 131949 | 胡海峰老师 | 两个数的最小距离 | Python3 | Accepted | 55 MS | 3856 KB | 244 | 2025-10-01 21:08:39 |
n = int(input()) a = list(map(int, input().split())) a.sort() min_dist = float('inf') for i in range(1, n): diff = a[i] - a[i - 1] # 因为排序了,所以非负 if diff < min_dist: min_dist = diff print(min_dist)