编写一个方法,使用下面的方法头对二维数组排序:
public static void sort(int m[][])
这个方法首先按行排序,然后按列排序。
例如:数组{{4,2}, {1,7}, {4,5}, {1,2}, {1,1}, {4,1}},被排序为{{1,1}, {1,2}, {1,7}, {4,1}, {4,2}, {4,5}}。
测试数据:
4 2
1 7
4 5
1 2
1 1
4 1
package pack2;
import java.util.Scanner;
public class SortArray {
public static void main(String[] args) {
sortArray();
}
public static void sortArray() {
try(Scanner input = new Scanner(System.in);) {
System.out.print("Enter rows and columns of an array: ");
int[][] m = new int[input.nextInt()][input.nextInt()];
System.out.println("Enter array:");
for (int i = 0; i < m.length; i++)
for (int j = 0; j < m[i].length; j++)
m[i][j] = input.nextInt();
System.out.println("\nBefore sorted: ");
printMatrix(m);
sort(m);
System.out.println("\nAfter sorted: ");
printMatrix(m);
}
}
/**排序*/
public static void sort(int m[][]) {
for (int i = 1; i < m.length; i++) {
boolean flag = true;
for (int j = 0; j < m.length - i; j++)
if(m[j][0] > m[j + 1][0]) { //判断行
swap(m, j);
flag = false;
}else if(m[j][0] == m[j + 1][0]) { //行相等时,
for (int k = 0; k < m[i].length; k++) //判断列
if(m[j][k] > m[j + 1][k]) {
swap(m, j);
flag = false;
}
}
if(flag) break;
}
}
/**二维数组交换行*/
public static void swap(int[][] m, int index) {
int[] temp = m[index];
m[index] = m[index + 1];
m[index + 1] = temp;
}
/**打印矩阵*/
public static void printMatrix(int[][] matrix) {
for (int i = 0; i < matrix.length; i++) {
for (int j = 0; j < matrix[i].length; j++)
System.out.print(" " + matrix[i][j]);
System.out.println();
}
}
}