import random
from timewrap import *def list_to_buckets(li, iteration):#这个是用来比较每个位置的大小的数字"""因为分成10个本来就是有序的所以排出来就是有序的。:param li: 列表:param iteration: 装桶是第几次迭代:return:"""buckets = [[] for _ in range(10)]print('buckests',buckets)for num in li:digit = (num // (10 ** iteration)) % 10buckets[digit].append(num)print(buckets)return bucketsdef buckets_to_list(buckets):#这个是用来出数的return [num for bucket in buckets for num in bucket]# li = []# for bucket in buckets:#     for num in bucket:#         li.append(num)

@cal_time
def radix_sort(li):maxval = max(li) # 10000it = 0while 10 ** it <= maxval:#这个是循环用来，在以前一次排序的基础上在排序。li = buckets_to_list(list_to_buckets(li, it))it += 1return li# li = [random.randint(0,1000) for _ in range(100000)]
li = [random.randint(0,10) for _ in range(10)]
li=[5555,5525,9939,9999,6,3,8,9]
s=radix_sort(li)
print(s)

def insert_sort(li):#插入排序for i in range(1, len(li)):# i 表示无序区第一个数tmp = li[i] # 摸到的牌j = i - 1 # j 指向有序区最后位置while li[j] > tmp and j >= 0:#循环终止条件： 1. li[j] <= tmp; 2. j == -1li[j+1] = li[j]j -= 1li[j+1] = tmpdef shell_sort(li):#希尔排序  与插入排序区别就是把1变成dd = len(li) // 2while d > 0:for i in range(d, len(li)):tmp = li[i]j = i - dwhile li[j] > tmp and j >= 0:li[j+d] = li[j]j -= dli[j+d] = tmpd = d >> 1li=[5,2,1,4,5,69,20,11]
shell_sort(li)
print(li)

#计数排序
# 0 0 1 1 2 4 3 3 1 4 5 5
import random
import copy
from timewrap import *@cal_time
def count_sort(li, max_num = 100):count = [0 for i in range(max_num+1)]for num in li:count[num]+=1li.clear()for i, val in enumerate(count):for _ in range(val):li.append(i)@cal_time
def sys_sort(li):li.sort()li = [random.randint(0,100) for i in range(100000)]
li1 = copy.deepcopy(li)
count_sort(li)
sys_sort(li1)

s = "anagram"
t = "nagaram"def ss(s,t):return  sorted(list(s))==sorted(list(t))
y=ss(s,t)
print(y)

 1 def searchMatrix(matrix, target):
 2     m = len(matrix)
 3     # print('m', m)
 4     if m == 0:
 5         return False
 6     n = len(matrix[0])
 7     if n == 0:
 8         return False
 9     low = 0
10     high = m * n - 1
11     # print('high',high)
12     while low <= high:
13         mid = (low + high) // 2
14         x, y = divmod(mid, n)
15         if matrix[x][y] > target:
16             high = mid - 1
17         elif matrix[x][y] < target:
18             low = mid + 1
19         else:
20             return True
21     else:
22         return False
23
24
25 s = [
26     [1, 2, 3],
27     [4, 5, 6],
28     [7, 8, 9]
29 ]
30 # print(searchMatrix(s, 1))
31 # print(searchMatrix(s, 2))
32 # print(searchMatrix(s, 3))
33 # print(searchMatrix(s, 4))
34 # print(searchMatrix(s, 5))
35 # print(searchMatrix(s, 6))
36 print(searchMatrix(s, 7))
37 # print(searchMatrix(s, 8))
38 # print(searchMatrix(s, 9))

View Code

def twoSum(num, target):dict = {}for i in range(len(num)):print(dict)x = num[i]if target - x in dict:return dict[target - x], idict[x] = il = [1, 2, 5, 4]
print(twoSum(l, 7))