稀疏数组

最新推荐文章于 2023-04-25 21:43:42 发布

耀希

最新推荐文章于 2023-04-25 21:43:42 发布

阅读量138

点赞数

本文链接：https://blog.csdn.net/weixin_44262354/article/details/106515620

版权

public class demo01 {
    public static void main(String[] args) {
        int[][] array1 = new int[10][10];

        array1[2][3] = 1;
        array1[3][4] = 2;
        //建立原始数组
        for (int[] ints : array1) {
            for (int anInt : ints) {
                System.out.print(anInt + "\t");
            }
            System.out.println(" ");
        }
        //建立稀疏数组
        int sum = 0;
        for (int i = 0; i <10 ; i++) {
            for (int j = 0; j <10 ; j++) {
                if (array1[i][j] != 0){
                    sum++;
                }
            }
        }

        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 <array1.length ; i++) {
            for (int j = 0; j <array1[i].length ; 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++) {
            System.out.print(array2[i][0] + "\t");
            System.out.print(array2[i][1] + "\t");
            System.out.println(array2[i][2] + "\t");
        }

        //还原普通数组
        int[][] array3 = new int[array2[0][0]][array2[0][1]];

        for (int i = 1; i <array2.length ; i++) {
            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(" ");
        }

    }

}