摘要：i = 1while i <= 9: i += 1 j = 1 while j <= i-1: print("{}*{}=".format(j,i-1),j*(i-1),sep='',end=' ') j += 1 print('') for i in range(1,10): for y in r 阅读全文

摘要：listA = [2,2,5,5,45,3,1,3] listB = [2,2,5,5,45,3,1,3] listC = [2,2,5,5,45,3,1,3] #法一：set print(list(set(listA))) #法二 tmp = [] for i in listB: if i not 阅读全文

摘要：listA = [1,2,3,4] listB = [8,7,6,5] listC = list(zip(listA,listB)) print(listC) listD = [x+y for x ,y in listC] print(listD) 阅读全文

摘要：listA = [1,2,5,9,34,99] listB = [3,6,15,59,88] def fun(arg1,arg2): tmp = [] while len(arg1) > 0 and len(arg2) > 0: if arg1[0] > arg2[0]: tmp.append(ar 阅读全文

摘要：def func(n, first=True): if n == 0: if first: return '0b0' else: return '0b' return str(func(n//2, False))+str(n%2) print(func(0)) print(func(3)) prin 阅读全文

摘要：string = 'aovbzoasvaobvdoaobgvo;sogvosov;svgoas;shvbpe;;svoovohoaosobvboeaso' string_set = list(set(string)) print(string_set) conuts = list(map(strin 阅读全文

摘要：time.time() #获取当前时间戳 1587743489.9542704 time.localtime() #获取本地时间，年月日时分秒周，一年中第几天 time.struct_time(tm_year=2020, tm_mon=4, tm_mday=24, tm_hour=23, tm_mi 阅读全文

摘要：#二进制法 def PowerSetBinary1(arg): size = len(arg) set_all = [] for i in range(2**size): tmp = [] for y in range(size): if (i>>y) % 2 : tmp.append(arg[y] 阅读全文

摘要：#法一 for i in range(1,10): print() for y in range(1,i+1): print('{}*{}={}'.format(y,i,y*i),end=' ') #法二 print('\n'.join([' '.join(['%s*%s=%s' %(y,x,x*y 阅读全文

摘要：#导包方式引入 #new方法实现 class Student(): def __new__(self): if not hasattr(self,'instance'): self.instance =super(Student,self).__new__(self) return self.ins 阅读全文

摘要：listA = [1,2,3,4,5,6] def fun(arg,arg1): low = 0 high = len(arg)-1 while low <= high: mid = arg[(low + high) // 2] print(mid) if mid == arg1: return a 阅读全文

摘要：def bucket_sort(arr): bucket = [0]*(max(arr)-min(arr)+1) for i in range(len(arr)): bucket[arr[i]-min(arr)] += 1 print(bucket) res = [] for i in range( 阅读全文

摘要：def quicksort(arr): if len(arr) <= 1: return arr pivot = arr[len(arr) // 2] left = [x for x in arr if x < pivot] middle = [x for x in arr if x == pivo 阅读全文

摘要：def selectsort(arg): for i in range(len(arg)-1): middle = i for y in range(i+1,len(arg)): if arg[middle] > arg[y]: middle = y arg[i],arg[middle] = arg 阅读全文

摘要：def bubbling_sort(arg): for i in range(len(arg)-1): for y in range(len(arg)-i-1): if arg[y]>arg[y+1]: arg[y],arg[y+1] = arg[y+1],arg[y] return arg 阅读全文