稀疏数组练习

最新推荐文章于 2024-11-09 12:43:52 发布

SevenPureG

最新推荐文章于 2024-11-09 12:43:52 发布

阅读量72

点赞数

文章标签： java 算法数据结构

本文链接：https://blog.csdn.net/a2638/article/details/128554723

版权

稀疏数组练习


package com.Pure.Arrarys;

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

        array1[1][2] = 1;
        array1[2][3] = 1;

        for (int[] ints : array1) {
            for (int anInt : ints) {
                System.out.print(anInt + " ");
            }
            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++;
                }
            }
        }
        System.out.println("有效值个数：" + sum);

        //创建稀疏数组
        int[][] array2 = new int[sum + 1][2];
        array2[0][0] = 11;
        array2[0][1] = 11;
        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];
                }
            }
        }
        System.out.println("稀疏数组：");
        for (int i = 0; i < array2.length; i++) {
            System.out.println(array2[i][0] + " "
                    + array2[i][1] + " " + array2[i][2] + " ");
        }

        System.out.println("=======================");
        System.out.println("还原");
        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 + " ");
            }
            System.out.println();
        }
        //java自动赋初值 0 
    }
}