java 1.85 冒泡排序，稀疏数组

输出结果：[0, 1, 3, 6, 8, 2, 5, 47, 6, 3, 58]

稀疏数组

public class Test023 {
    public static void main(String[] args) {
        //创建一个原始数组
        int[][]array=new int[10][10];
        array[0][0]=1;
        array[9][9]=2;
        System.out.println("原始数组为：");
        for (int[] ints : array) {
            for (int anInt : ints) {
                System.out.print(anInt+"\t");
            }
            System.out.println();
        }
        System.out.println();
        System.out.println("==================================");
        //获取有效值的个数
        int sum=0;
        for (int i = 0; i < 10; i++) {
            for (int j = 0; j < 10; j++) {
                if (array[i][j]!=0)
                    sum++;
            }
            
        }
        System.out.println("有效值的个数："+sum);
        System.out.println("=======================================");
//创建一个稀疏数组
        int [][] array2=new int[sum+1][3];
        array2[0][0]=10;
        array2[0][1]=10;
        array2[0][2]=sum;
        //遍历二维数组
        int count=0;
        for (int i = 0; i < array.length; i++) {
            for (int j = 0; j < array[i].length; j++) {
                if (array[i][j]!=0) {
                    count++;
                    array2[count][0]=i;
                    array2[count][1]=j;
                    array2[count][2]=array[i][j];
                }
            }
        }
        //输出稀疏数组
        for (int i = 0; i