package cn.aparke.sort;

import java.util.ArrayList;
import java.util.Arrays;
import java.util.Collections;
import java.util.List;

//二维数组排序,按照矩阵方式打印
public class TwoDimenSort {
	public static void main(String[] args) {
		// 二维数组的初始化
		String[][] twoDimens = { { "one2", "one3", "one1" }, { "2two", "3two", "1two" } };

		// 排序
		for (String[] strings : twoDimens) {
			Arrays.sort(strings);
		}
		// 打印
		for (String[] strings : twoDimens) {
			for (String stringsSort : strings) {
				System.out.print(stringsSort + " ");
			}
			System.out.println();
		}
		
		System.out.println("--------------------------分界线——————————————————————————————————");
		
		
		// 逆序打印reverse() 字符串反转 需在集合中使用，故将数组改为集合
       List<String> arrayList = null;
       
		for (String[] strings : twoDimens) {
//			Arrays.sort(strings);
			//将排完序的数组变为集合
			List<String> arrayToList = Arrays.asList(strings);
			Collections.reverse(arrayToList);
			arrayToList.toArray(strings);
		} 
		// 打印
		for (String[] strings : twoDimens) {
			for (String stringsSort : strings) {
				System.out.print(stringsSort + " ");
			}
			System.out.println();
		}
		
	}
}

package cn.aparke.sort;

import java.util.Arrays;

//二维数组排序,按照矩阵方式打印
public class TwoDimenSort2 {

	public static void main(String[] args) {
		// 初始化二维数组
		int row = 3;
		int col = 4;
		// 随机赋值
		int a[][] = new int[row][col];
		for (int i = 0; i < row; i++) {
			for (int j = 0; j < col; j++) {
				a[i][j] = (int) (Math.random() * 10);
			}
		}
		System.out.println("排序前：");
		for (int i = 0; i < row; i++) {
			for (int j = 0; j < col; j++) {
				System.out.print(a[i][j] + " ");
			}
			System.out.println();
		}
		// 将二维数组赋值给一维数组
		int b[] = new int[row * col];
		int k = 0;
		for (int i = 0; i < row; i++) {
			for (int j = 0; j < col; j++) {
				b[k] = a[i][j];
				k++;
			}
		}
		// 排序 打印一把看看是否排好序
		Arrays.sort(b);
		
		System.out.println(Arrays.toString(b));
		
		//将排好序的一维数组赋值给二维数组
		k=0;
		for (int i = 0; i < row; i++) {
			for (int j = 0; j < col; j++) {
				a[i][j]=b[k];
				k++;
			}
		}
		
		//矩阵（二维数组方式）打印出来
		//排序后
		System.out.println("排序后：");
		for (int i = 0; i < row; i++) {
			for (int j = 0; j < col; j++) {
				System.out.print(a[i][j] + " ");
			}
			System.out.println();
		}

//		//逆序打印 将一位数组排好序后，使用String Buffer处理
//		String string = Arrays.toString(b);
//		StringBuffer sb = new StringBuffer(string);
//		StringBuffer reverse = sb.reverse();
//		String substring = reverse.substring(1, reverse.length()-1);
//		System.out.println(substring);
		
		//逆序打印
		System.out.println("逆序排序后：");
		for (int i = row-1; i >= 0; i--) {
			for (int j = col-1; j >=0; j--) {
				System.out.print(a[i][j] + " ");
			}
			System.out.println();
		}
	}

}