# 二维数组升序排列

code 专栏收录该内容
18 篇文章 0 订阅
package tao.leetcode;
import java.util.*;
/**
* Created by Tao on 2017/7/30.
*/
public class MyLeetcode {
public static void main(String[] args) {
int[][] people = {{7,0}, {4,4}, {7,1}, {5,0}, {6,1}, {5,2}};
final int[] arOrders = {1,0};
Arrays.sort(people, new Comparator<Object>() {
public int compare(Object oObjectA, Object oObjectB) {
int[] arTempOne = (int[])oObjectA;
int[] arTempTwo = (int[])oObjectB;
for (int i = 0; i < arOrders.length; i++) {
int k = arOrders[i];
if (arTempOne[k] > arTempTwo[k]) {
return 1;
}
else if (arTempOne[k] < arTempTwo[k]) {
return -1;
}
else {
continue;
}
}
return 0;
}
});

for (int i = 0; i < people.length; i++) {
for (int j = 0; j < people[0].length; j++) {
System.out.print(people[i][j] + " ");
}
System.out.println();
}
}
}


output：
5 0
7 0
6 1
7 1
5 2
4 4

        Arrays.sort(people, new Comparator<int[]>() {
public int compare(int[] a, int[] b) {
if (b[0] == a[0]) return a[1] - b[1]; //第二列由大到小排列
return b[0] - a[0]; ////第一列由大到小排列
}
}`
• 0
点赞
• 0
评论
• 0
收藏
• 打赏
• 扫一扫，分享海报

06-09
11-19 896
03-15 4万+
04-01 5608
09-08 32
02-07 175
10-16 1221
09-29 8337
10-16 7903
07-25 554

OddBillow

¥2 ¥4 ¥6 ¥10 ¥20

1.余额是钱包充值的虚拟货币，按照1:1的比例进行支付金额的抵扣。
2.余额无法直接购买下载，可以购买VIP、C币套餐、付费专栏及课程。