| Run ID | 作者 | 问题 | 语言 | 测评结果 | Time | Memory | 代码长度 | 提交时间 |
|---|---|---|---|---|---|---|---|---|
| 134224 | 胡海峰老师 | 两个数的最小距离 | Python3 | Accepted | 53 MS | 3860 KB | 209 | 2025-10-26 09:33:10 |
n = int(input()) a = list(map(int, input().split())) a.sort() min_dist = a[1]-a[0] for i in range(1, n-1): diff = a[i+1] - a[i] if diff < min_dist: min_dist = diff print(min_dist)