2021-11-16

**

**

稀疏数组

package com.li.base;

import java.util.Arrays;

public class arrayDemo02 {
    public static void main(String[] args) {
//创建二维数组11*11
        int[][] array1 = new int [11][11];
        array1[1][2] = 1;
        array1[2][3] = 2;
        //输出原始数组
        System.out.println("原始数组");
        //两组增强for循环，不太明白怎么用
        for(int[] ints: array1){
            for(int anInt: ints){
                System.out.print(anInt+"t");
            }
            System.out.println();
        }
        System.out.println("******************************8**");
        //转换为稀疏数组
        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);
        
        //创建稀疏数组
        int[][] array2 = new int[sum+1][3];
        array2[0][0] = 11;
        array2[0][1] = 11;
        array2[0][2] = sum; 
        //遍历原数组，将非0值存入稀疏数组
        int count = 0;
        for (int i = 0; i