马上注册,结交更多好友,享用更多功能^_^
您需要 登录 才可以下载或查看,没有账号?立即注册
x
本帖最后由 不二如是 于 2022-9-1 18:07 编辑
一星答案:
def fishc(data):
b = []
le = len(data)
for i in range(0, le):
b.append(data[i])
min = abs(data[0]-b[1])
for i in range(le):
for j in range(le):
if i == j:
break
if abs(data[i]-b[j]) < min:
min = abs(data[i]-b[j])
return min
a = [134, 43, -1876, 565, 1, 85, -63443, 569, -1899, 135, 9999]
print(fishc(a))
二星答案:
def fishc(my_list):
the_list = []
for i in my_list:
for k in my_list:
n = abs(i-k)
the_list.append(n)
# 下面2句是为了清除差列表中自身相减得到的0
for t in range(1, len(my_list)+1):
the_list.remove(0)
minnum = min(the_list)
return minnum
if __name__ == '__main__':
a = [134, 43, -1876, 565, 1, 85, -63443, 569, -1899, 135, 9999]
print(fishc(a))
三星答案:
a = [134, 43, -1876, 565, 1, 85, -63443, 569, -1899, 135, 9999]
a.sort()
m = min([abs(a[i] - a[i + 1]) for i in range(len(a) - 1)])
print(m)
基础语法:
算法讲解:
|