Java稀疏数组

package com.wfy.array;

//稀疏数组
public class ArrayDemo02 {
    public static void main(String[] args) {
        //创建一个二维数组11*11
        int[][] arrya1 = new int[11][11];
        arrya1[1][1] = 1;
        arrya1[2][4] = 2;
        //输出数组
        System.out.println("输出原始的数组");
        for (int[] ints : arrya1) {
            for (int anInt : ints) {
                System.out.print(anInt + "\t");
            }
            System.out.println();
        }

        //转换稀疏数组
        //获取有效值
        int sum = 0;
        for (int i = 0; i < 11; i++) {
            for (int j = 0; j < 11; j++) {
                if (arrya1[i][j] != 0) {
                    sum++;
                }
            }
        }
        System.out.println("获取有效值" + sum);

        //2创建稀疏数组的数组
        int[][] arrya2 = new int[sum + 1][3];

        arrya2[0][0] = 11;
        arrya2[0][1] = 11;
        arrya2[0][2] = sum;

        //遍历二维数组，将非零的值，存放稀疏数组中
        int count = 0;
        for (int i = 0; i < arrya1.length; i++) {
            for (int j = 0; j < arrya1[i].length; j++) {
                if (arrya1[i][j] != 0) {
                    count++;
                    arrya2[count][0] = i;
                    arrya2[count][1] = j;
                    arrya2[count][2] = arrya1[i][j];
                }
            }
        }

        //稀疏数组
        System.out.println("稀疏数组");
        for (int i = 0; i < arrya2.length; i++) {
            System.out.println(arrya2[i][0] + "\t"
                    + arrya2[i][1]+"\t"
                    + arrya2[i][2]+"\t"
            );
        }

        System.out.println("还原");
        //读取稀疏数组
        int[][] arrya3 = new int[arrya2[0][0]][arrya2[0][1]];
        //给其中的元素还原他的值
        for (int i = 1; i < arrya2.length; i++) {
            arrya3[arrya2[i][0]][arrya2[i][1]]=arrya2[i][2];
        }
        //打印
        System.out.println("输出还原后的数组");
        for (int[] ints : arrya3){
            for (int anInt : ints){
                System.out.print(anInt+"\t");
            }
            System.out.println();
        }
    }
}