?

--[[?

穩(wěn)定的多維條件數(shù)組排序?

由調(diào)用者保證tbCondition的元素個數(shù)大于等于維度nDimension?

]]?

function?MutilArraySort(tbCondition,?nDimension)?

????local?tbResult?=?{}?

????for?i?=?1,?#tbCondition?do?

????????local?nInsert?=?0?

????????local?nLocal?=?1?

????????for?k?=?1,?nDimension?do?

????????????local?function?DimensionCompare(j)?

????????????????if?j?>?#tbResult?then?

????????????????????return?#tbCondition?+?1?

????????????????end?

????????????????if?tbCondition[i][k]?>?tbCondition[tbResult[j]][k]?then?

????????????????????return?j?

????????????????elseif?tbCondition[i][k]?==?tbCondition[tbResult[j]][k]?then?

????????????????????return?0,?j?

????????????????else?

????????????????????return?DimensionCompare(j?+?1)?

????????????????end?

????????????end?

????????????nInsert,?nLocal?=?DimensionCompare(nLocal)?

????????????if?nInsert?>?0?and?nInsert?<=?#tbResult?then?

????????????????table.insert(tbResult,?nInsert,?i)?

????????????????break?

????????????elseif?nInsert?>?#tbResult?then?

????????????????table.insert(tbResult,?i)?

????????????????break?

????????????end?

????????????if?k?==?nDimension?then?

????????????????table.insert(tbResult,?i)?

????????????????break?

????????????end?

????????end?

????end?

????return?tbResult?

end?

?

tbCondition?=?{?

????[1]?=?{?1,?2,?6,?6?},?

????[2]?=?{?5,?2,?8,?5?},?

????[3]?=?{?5,?2,?7,?6?},?

????[4]?=?{?5,?2,?1,?4?},?

}?

local?tbResult?=?MutilArraySort(tbCondition,?4)?

for?i?=?1,?#tbResult?do?

????print(tbResult[i])?

end?

?

轉(zhuǎn)載于:https://blog.51cto.com/rangercyh/1160537

總結(jié)

以上是生活随笔為你收集整理的稳定多维table排序的全部內(nèi)容，希望文章能夠幫你解決所遇到的問題。

如果覺得生活随笔網(wǎng)站內(nèi)容還不錯，歡迎將生活随笔推薦給好友。