0
点赞
收藏
分享

微信扫一扫

java稀疏数组

八怪不姓丑 2022-02-11 阅读 75

稀疏数组的代码,第一次接触到稀疏数组,很新颖

public static void main(String[] args) {
        int[][] qi=new int[11][11];
        qi[1][2]=1;
        qi[2][3]=2;
        System.out.println("输出原始的数组");
        for (int[] ints : qi) {
            for (int anInt : ints) {
                System.out.print(anInt+"\t");
            }
            System.out.println();
        }
        System.out.println("==================================");
        int sum=0;
        for (int i = 0; i < 11; i++) {
            for (int j = 0; j < 11; j++) {
                if (qi[i][j]!=0){
                    sum++;
                }
            }
        }
        System.out.println(sum);

        //创建一个稀疏数组的数组
        int[][]array2 =new int[sum+1][3];
        array2[0][0]=11;
        array2[0][1]=11;
        array2[0][2]=sum;

        //遍历二维数组,将非零的值,存放稀疏数组中
        int a=0;
        for (int i = 0; i < qi.length; i++) {
            for (int j = 0; j < qi[i].length; j++) {
                if (qi[i][j]!=0){
                    a++;
                    array2[a][0]=i;
                    array2[a][1]=j;
                    array2[a][2]=qi[i][j];
                }
            }
        }
        //输出稀疏数组
        for (int i = 0; i < array2.length; i++) {
            System.out.println(array2[i][0]+"\t"
                    +array2[i][1]+"\t"
                    +array2[i][2]+"\t");
        }
        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+"\t");
            }
            System.out.println();
        }
    }
举报

相关推荐

0 条评论