我有一個list容器,其中存放的是結構體數據,數據格式如下
class TestID:
def __int__(self):
self.id = -1
self.similary = 0.0
排序的格式:相似度從大到小,ID號從大到小
意思是:當相似度相同時,ID號再進行排序
那麼,我的初始化數據如下所示,僅做參考樣本數據
arr_list = []
st = TestID()
st.id = 10
st.similary = 0.88
arr_list.append(st)
st = TestID()
st.id = 8
st.similary = 0.78
arr_list.append(st)
st = TestID()
st.id = 9
st.similary = 0.88
arr_list.append(st)
st = TestID()
st.id = 1
st.similary = 0.5
arr_list.append(st)
st = TestID()
st.id = 2
st.similary = 1
arr_list.append(st)
我列舉的結構體中有兩個相似度相同(0.88),ID不同的數據
排序方法:
def __sortTestSTGroup(self , testST ):
length = len(testST )
for i in range(1, length):
x = testST [i]
x_similary = testST [i].similarity
x_id = testST [i].id
for j in range(i, -1, -1):
# j爲當前位置,試探j-1位置
temp_id = testST [j - 1].id
temp_similary = testST [j - 1].similarity
if x_similary == temp_similary:
if x_id < temp_id:
testST [j] = testST [j - 1]
else:
break
elif x_similary > temp_similary:
testST [j] = testST [j - 1]
else:
# 位置確定爲j
break
testST [j] = x
# for item in testST :
# str_los = '改變後的內容:id=%s,similarity=%f' % (x.id, x.similarity)
# print(str_los)