稀疏数组

 

 

package com.strtuct;

public class Demo6 {
    public static void main(String[] args) {
        //1.创建一个二维数组 11*11 0:没有棋子，1：黑棋，2：白棋
        int[][] array1=new int[11][11];
        array1[1][2]=1;
        array1[2][3]=2;
        System.out.println("输出原始数组");

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

        System.out.println("====================转换为稀疏数组=========================");
        //转换为稀疏数组保存
        //获取有效值的个数
        int sum=0;
        for (int i = 0; i < array1.length; i++) {
            for (int j = 0; j < array1[0].length; j++) {
                if (array1[i][j]!=0){
                    sum++;
                }
            }
        }
        //1.创建稀疏数组
        int[][] array2=new int[sum+1][3];
        array2[0][0]= array1.length;
        array2[0][1]=array1[0].length;
        array2[0][2]=sum;

        //遍历数组，将非零的值，存放在稀疏数组中
        int count=0;
        for (int i = 0; i < array1.length; i++) {
            for (int j = 0; j < array1[0].length; j++) {
                if (array1[i][j]!=0){
                    count++;
                    array2[count][0]=i;
                    array2[count][1]=j;
                    array2[count][2]=array1[i][j];
                }
            }
        }
        for (int[] ints : array2) {
            for (int anInt : ints) {
                System.out.print(anInt+"\t");
            }
            System.out.println();
        }

        System.out.println("============稀疏数组转换为原始数组=================================");
        int [][]array3=new int[array2[0][0]][array2[0][1]];
        int j=0;
        for (int i = 1; i <=array2[0][2]; i++) {
                array3[array2[i][j]][array2[i][j+1]]=array2[i][j+2];
        }
        for (int[] ints : array3) {
            for (int anInt : ints) {
                System.out.print(anInt+"\t");
            }
            System.out.println();
        }

    }

}