Java中将二维数组转化为稀疏数组

import java.util.Arrays;

public class SparseArray{
    
    
    public static void main(String[] args) {
    
    
        int[][] arr = new int[11][11];
        arr[1][2] = 6;
        arr[2][3] = 66;
        for (int i = 0; i < arr.length; i++) {
    
    
            System.out.println(Arrays.toString(arr[i]));
        }
        sparseArray(arr);
    }

    // 统计数组中有多少个有数据的数
    public static int arraysNum(int[][] arrays){
    
    
        int num = 0;
        for (int i = 0; i < arrays.length; i++) {
    
    
            for (int j = 0; j < arrays[i].length; j++) {
    
    
                if (arrays[i][j] != 0){
    
    
                    num++;
                }
            }
        }
        return num;
    }

    // 将数组转化为稀疏数组的函数
    public static void sparseArray(int[][] arrays){
    
    
        int count = 0;
        int[][] result = new int[arraysNum(arrays) + 1][3];
        result[0][0] = arrays.length;
        result[0][1] = arrays[0].length;
        result[0][2] = arraysNum(arrays);
        for (int i = 0; i < arrays.length ; i++) {
    
    
            for (int j = 0; j < arrays[i].length; j++) {
    
    
                if (arrays[i][j] != 0){
    
    
                    count++;
                    result[count][0] = i;
                    result[count][1] = j;
                    result[count][2] = arrays[i][j];
                }
            }
        }
        for (int i = 0; i < result.length; i++) {
    
    
            System.out.println(Arrays.toString(result[i]));
        }
    }
}