❤️稀疏数组的建立与还原（建议收藏）❤️

约定不等于承诺〃 2023-10-04 10:18 58阅读 0赞

## 稀疏数组的建立与还原(Java详解) ##

###### 源码如下: ######

package array;
    
    public class ArrayDemo08 {
        
        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("===================================");
            //转换为稀疏数组保存
            //1.获取有效值的个数
            int sum=0;
            for (int i = 0; i <11; i++) {
        
                for (int j = 0; j < 11; j++) {
        
                    if(array1[i][j]!=0)
                    {
        
                        sum++;
                    }
                }
            }
            System.out.println("有效值个数为;"+sum);
    
            //2.创建一个稀疏数组的数组
            int[][] array2=new int[sum+1][3];
            array2[0][0]=11;
            array2[0][1]=11;
            array2[0][2]=sum;
    
            //3.遍历二维数组，将非零的值，存放到稀疏数组中
            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]+"\t"+array2[i][1]+"\t"+array2[i][2]+"\t");
            }
    
            System.out.println("===================================");
            System.out.println("稀疏数组还原");
            //1.读取稀疏数组的值
            int[][] array3=new int[array2[0][0]][array2[0][1]];
            //2.给其中的元素还原它的值
            for (int i=1;i<array2.length;i++)
            {
        
                array3[array2[i][0]][array2[i][1]]=array2[i][2];
            }
            //3.打印还原
            System.out.println("输出还原数组");
            for (int[] ints:array3)
            {
        
                for(int anInt:ints)
                {
        
                    System.out.print(anInt+"\t");
                }
                System.out.println();
            }
    
        }
    }

--------------------

###### 运行结果： ######

![在这里插入图片描述][watermark_type_ZmFuZ3poZW5naGVpdGk_shadow_10_text_aHR0cHM6Ly9ibG9nLmNzZG4ubmV0L3dlaXhpbl81MDU2OTc4OQ_size_16_color_FFFFFF_t_70_pic_center]  
\*\*\*![在这里插入图片描述][20210409225732475.png_pic_center]  
\*\*\*![在这里插入图片描述][watermark_type_ZmFuZ3poZW5naGVpdGk_shadow_10_text_aHR0cHM6Ly9ibG9nLmNzZG4ubmV0L3dlaXhpbl81MDU2OTc4OQ_size_16_color_FFFFFF_t_70_pic_center 1]

--------------------

[watermark_type_ZmFuZ3poZW5naGVpdGk_shadow_10_text_aHR0cHM6Ly9ibG9nLmNzZG4ubmV0L3dlaXhpbl81MDU2OTc4OQ_size_16_color_FFFFFF_t_70_pic_center]: https://img-blog.csdnimg.cn/20210409225723490.png?x-oss-process=image/watermark,type_ZmFuZ3poZW5naGVpdGk,shadow_10,text_aHR0cHM6Ly9ibG9nLmNzZG4ubmV0L3dlaXhpbl81MDU2OTc4OQ==,size_16,color_FFFFFF,t_70#pic_center
[20210409225732475.png_pic_center]: https://img-blog.csdnimg.cn/20210409225732475.png#pic_center
[watermark_type_ZmFuZ3poZW5naGVpdGk_shadow_10_text_aHR0cHM6Ly9ibG9nLmNzZG4ubmV0L3dlaXhpbl81MDU2OTc4OQ_size_16_color_FFFFFF_t_70_pic_center 1]: https://img-blog.csdnimg.cn/20210409225740226.png?x-oss-process=image/watermark,type_ZmFuZ3poZW5naGVpdGk,shadow_10,text_aHR0cHM6Ly9ibG9nLmNzZG4ubmV0L3dlaXhpbl81MDU2OTc4OQ==,size_16,color_FFFFFF,t_70#pic_center