稀疏矩阵压缩算法（伪地址）的java代码实现（压缩和解析）

压缩和解析功能实现

import java.lang.reflect.Array;

/**
 * className:Matrix
 *
 * @author:zjl
 * @version:0.1
 * @date:2020/7/1111:37
 * @since:jdk1.8
 */
public class Matrix {
    /**
     * 伪地址法压缩矩阵
     * @param obj
     * @return
     */
    public int[][] press(int[][] obj ){
        int m=obj.length;
        int n =obj[0].length;
        int c=0;
        for (int i =0;i<obj.length;i++){
            for (int j=0;j<obj[0].length;j++){
                if(obj[i][j]!=0){
                    c++;
                }
            }
        }
        int[][] arrayPress = new int[c+1][2];
        arrayPress[0][0] = m;
        arrayPress[0][1] = n;

        int count =1;
        for (int i =0;i<obj.length;i++){
            for (int j=0;j<obj[0].length;j++){
                if(obj[i][j]!=0){
                    arrayPress[count][0] = n*i+j;//伪地址计算
                    arrayPress[count][1] = obj[i][j];
                    count++;
                }
            }
        }
        return arrayPress;
    }

    /**
     * 解析压缩矩阵为原矩阵
     * @param arrayPress
     * @return
     */
    public int[][] analaysis(int[][] arrayPress){
        int[][] array = new int[arrayPress[0][0]][arrayPress[0][1]];
        for (int i=1;i<arrayPress.length;i++){
            //根据 arrayPress[count][count] = n*i+j;解析
            array[arrayPress[i][0]/arrayPress[0][1]][arrayPress[i][0]%arrayPress[0][1]] = arrayPress[i][1];
        }
        return array;
    }
}

测试类

/**
 * className:Test
 *
 * @author:zjl
 * @version:0.1
 * @date:2020/7/1113:54
 * @since:jdk1.8
 */
public class Test {

    public static void main(String[] args) {
        //创建矩阵
        int[][] array = new int[6][6];
        array[0][0] = 9;
        array[1][4] = 6;
        array[2][2] = 2;
        array[4][4] = 8;

        System.out.println("===============初始矩阵===============");

        //输出初始矩阵
        for (int i = 0; i < array.length; i++) {
            for (int j = 0; j < array[0].length; j++) {
                System.out.print(array[i][j]+"  ");
            }
            System.out.println();
        }


        Matrix matrix = new Matrix();

        System.out.println("============解压后得到的矩阵==========");

        //压缩矩阵
        int[][] press = matrix.press(array);
        //输出压缩矩阵
        for (int i = 0; i < press.length; i++) {
            for (int j = 0; j < press[0].length; j++) {
                System.out.print(press[i][j]+"  ");
            }
            System.out.println();
        }

        System.out.println("============解析得到的矩阵=============");

        //解析压缩矩阵
        int[][] analaysis = matrix.analaysis(press);
        //输出解析后的矩阵
        for (int i = 0; i < analaysis.length; i++) {
            for (int j = 0; j < analaysis[0].length; j++) {
                System.out.print(analaysis[i][j]+"  ");
            }
            System.out.println();
        }
    }

}