[技术交流] Python：每日一题 17（答题领鱼币）

def func(a,b):
    return abs(a-b)
import random
list1 = [random.randint(1,100) for i in range(10)]
print list1
list2 = []
for i in range(0,len(list1)+1):
    if i<=8:
        func(list1[i],list1[i+1])
        list2.append(func(list1[i],list1[i+1]))
print list2
print min(list2)
    

def minSub(lst):
    result = float('inf')
    for index1 in range(len(lst)-1):
        for index2 in range(index1+1, len(lst)):
            sub = abs(lst[index2] - lst[index1])
            if sub < result:
                result = sub
    return result

list1 = [3,12,35,47,90]
print(minSub(list1))

#  9

def getMinSub(lst):
    newList = sorted(lst)
    allSub = [newList[i+1]-newList[i] for i in range(len(lst)-1)]
    return min(allSub)
list1 = [1,3,4,7,20,65]
list2 = [3,12,98,7,100]
print(getMinSub(list1))
print(getMinSub(list2))

#  1
#  2

lst = [132,43,-1876,565,1,85,-63443,569,-1899,135]
lst.sort()
min = lst[1] - lst[0]
for i in range(len(lst)-1):
        if (min > lst[i + 1] - lst[i]):
                min = lst[i + 1] - lst[i]
print(min)

a = [1,4,7,9,34,5,8]
b = []
c = a[0]
for x in a[1:]:
    b.append(abs(x - c))
    c = x
print(min(b))

min(abs(i-ii) for i in range(10) for ii in range(10))

def f(lis):
    lis1 = []
    for i in lis:
        for j in lis:
            if i != j:
                lis1.append(abs(i - j))
    lis1.sort()
    return lis1[0]
a = [1,50,10,100,15]
result = f(a)
print(result)