1、现存在一组整数,统计每个整数的重复个数并按照重复个数、整数大小一次排序:
def reduplicate_sort(L):
print("The original iist is :",L)
count = len(L)
M = []
N = []
for i in range(0, count):
key = L[i]
cnt = 0
if i not in N:
for j in range(i, count):
if L[j] == key:
cnt += 1
N.append(j)
M.append([key, cnt])
return M
def sorted(L):
M = reduplicate_sort(L)
count = len(M)
for i in range(0, count):
index = i
for j in range(0, i)[::-1]:
if M[j][1] > M[index][1] :
M[j], M[index] = M[index], M[j]
index = j
elif M[j][1] == M[index][1] and M[j][0] > M[index][0]:
M[j], M[index] = M[index], M[j]
index = j
return M
if __name__ == "__main__":
L = [1, 2, 3, 4, 23, 6, 5, 23, 87, 43, 3, 3, 3, 3, 7, 7, 7, 7, 4, 4, 4, 1, 1, 1]
N = sorted(L)
print(N)