假設我有一個長度為 n 的二維陣列，有沒有辦法根據子陣列的大小按降序對二維陣列進行排序
例如：
{{"1","b","g"},{"e","3"},{"r","2","9","a"},{"2"}}
會成為：
{{"r","2","9","a"},{"1","b","g"},{"e","3"},{"2"}}
uj5u.com熱心網友回復：
String tab[][] = new String[][]{{"1","b","g"},{"e","3"},{"r","2","9","a"},{"2"}};
String temp[];
for (int i = 0; i <tab.length; i ) {
for (int j = i 1; j <tab.length; j ) {
if(tab[i].length < tab[j].length) {
temp = tab[i];
tab[i] = tab[j];
tab[j] = temp;
}
}
}
System.out.println(Arrays.deepToString(tab));
輸出： [[r, 2, 9, a], [1, b, g], [e, 3], [2]]
uj5u.com熱心網友回復：
這個問題需要更多細節。
考慮到給定的資料結構是一個陣列，它看起來像 -
[["1","b","g"],["e","3"],["r","2","9","a"],["2"]]
要在 python 中對這個陣列進行排序，請考慮以下給定的代碼：-
a = [["1","b","g"],["e","3"],["r","2","9","a"],["2"]]
a.sort(key=len)
它將根據子陣列的長度對陣列進行排序
轉載請註明出處，本文鏈接：https://www.uj5u.com/gongcheng/333899.html
上一篇：按LocalDate排序映射流
下一篇：分組和排序熊貓