稀疏数组

public class Demo03 {
    public static void main(String[] args) {
        System.out.println("打印原数组");
        int[][] array1 = new int[11][11];
        array1[1][2] = 1;
        array1[2][3] = 2;
        for (int[] ints : array1) {
            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 < array1.length; i++) {
            for (int j = 0; j < array1[i].length; j++) {
                if(array1[i][j]!=0)
                    sum++;
            }

        }

        int[][] array2 = new int[sum+1][3];
        array2[0][0] = 11;
        array2[0][1] = 11;
        array2[0][2] = sum;

        int count=0;

        for (int i = 0; i < 11; i++) {
            for (int j = 0; j < 11; j++) {
                if (array1[i][j]!=0){
                    count++;
                    array2[count][0] = i;
                    array2[count][1] = j;
                    array2[count][2] = array1[i][j];

                }
            }

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

        System.out.println("==================");
        System.out.println("转化稀疏数组");

        int[][] array3 = new int[ array2[0][0] ][ array2[0][1] ];
        for (int i = 1; i < array2.length; i++) {
            for (int j = 0; j < array2[i].length; j++) {
                array3[ array2[i][0] ][ array2[i][1] ] = array2[i][2];
            }
        }

        for (int[] ints : array3) {
            for (int anInt : ints) {
                System.out.print(anInt+"\t");
            }
            System.out.println();
        }

    }
}

打印

稀疏数组

原文：https://www.cnblogs.com/biqibaozuixiupaidaxing/p/14674408.html