//还原publicstaticint[][]toArray(int[][] yzm){int[][] num =newint[yzm[0][0]][yzm[0][1]];for(int i =1; i <= yzm[0][2]; i++){//i从1开始,到i=count
num[yzm[i][0]][yzm[i][1]]= yzm[i][2];}return num;}
Java稀疏数组实现压缩还原输出Test压缩//压缩 public static int[][] toXS(int[][] sum) { //获取原数组行,列,非0数量 int count = 0;//非0数量 int lin = 0;//行 int row = 0;//列 for (int[] a1 : sum) { for (int b : a1) { if