u014073185的专栏

''' selection sort ''' def selection_sort(lst): for i in range(len(lst)): min_index = i for j in range(i+1,len(lst)): if lst[j] < lst[min_index]: min_index = j lst.insert(i, lst.pop(min_

2->10: number = int(input('输入二进制数: ')) n=''.join([str((number>>a&0x1))for a in range(7,-1,-1)]); print n 20->2: bin=str(input('输入十进制数：')) count = 0 for i in range(0,len(bin)): if bin[i] == st

给你一个正整数列表 l, 输出l内所有数字的乘积末尾0的个数. countof2 = 0 countof5 = 0 for i in L: while(i%2==0): i = i/2 countof2 += 1 while(i%5==0): i = i/5 countof5 += 1 print min(cou