摘要：1 # 2.1.1 直接插入排序法 2 # a=[50,30,65,59,2,36,42,5,9] 3 class Solution: 4 def insertSort(self, a): 5 for i in range(1, len(a)): 6 key = a[i] 7 j = i - 1 8 阅读全文

摘要：1 a = 1000 2 count = 0 3 print(a) 4 t1 = time.time() 5 for i in range(1000000000): 6 result = random.randint(0, 1) 7 print(result) 8 if result: 9 a += 阅读全文

摘要：1 lit = [11, 22, 33, 44, 55, 66, 77, 88, 99] 2 3 4 def func(left, right, n): 5 middle = (left + right)//2 6 if left > right: 7 return -1 8 if n > lit[ 阅读全文

摘要：1 a = [1, 2, 44, 55, 77, 58, 6, 3, 8, 8, 75, 5, 6] 2 k = 0 3 while k < len(a): 4 for i in range(len(a) - 1): 5 if a[i] > a[i + 1]: 6 a[i], a[i + 1] = 阅读全文