java学习笔记 第八天 稀疏数组

稀疏数组的定义

package com.zhang.arrays;

public class Demo04 {public static void main(String[] args) {
//        打印原始数组
    int[][] array = new int[11][11];
    array[1][2] = 1;
    array[2][3] = 2;
    print(array);
    System.out.println("打印稀疏数组=============================================================");
//       打印稀疏数组

//        1.判断有效值的个数
    int sum = 0;
//        遍历原始数组array
    for (int i = 0; i < array.length; i++) {
        for (int j = 0; j < array[i].length; j++) {
            if (array[i][j] != 0) {
                sum++;
            }
        }
    }
    // 2.创建稀疏数组
    int[][] array1 = new int[sum + 1][3];
    array1[0][0] = 11;
    array1[0][1] = 11;
    array1[0][2] = sum;

    int count = 0;
    for (int i = 0; i < array.length; i++) {
        for (int j = 0; j < array[i].length; j++) {
            if (array[i][j] != 0) {
                count++;
                array1[count][0] = i;
                array1[count][1] = j;
                array1[count][2] = array[i][j];
            }
        }
    }
    print(array1);

// 打印数组方法
}
    public static void print(int[][]arrays){
        for (int i = 0; i <arrays.length ; i++) {
            System.out.println();
            for (int j = 0; j <arrays[i].length ; j++) {
                System.out.print(arrays[i][j]+"\t");
            }
        }
        System.out.println("\n");
    }
}