稀疏数组

稀疏数组：当一个数组中的大部分数据为相同数据时，可以用稀疏数组保存

方法：记录几行几列和不同值的个数，再把不同值的数据单独罗列出来，从而达到压缩的目的

没有什么难点，所以直接上代码了 

 

public class SparesArray {
    public static void main(String[] args) {
        int chessArr1[][] = new int[11][11];
        chessArr1[1][2] = 1;
        chessArr1[2][3] = 2;
        chessArr1[3][4] = 1;



        for (int[] row : chessArr1){
            for (int data : row){
                System.out.printf("%d\t",data);
            }
            System.out.println();
        }

        int sum = 0;
        for (int i = 0; i < 11; i++){
            for (int j = 0; j < 11; j++){
                if (chessArr1[i][j] != 0){
                    sum++;
                }
            }
        }


        int sparesArr[][] = new int[sum+1][3];
        sparesArr[0][0] = 11;
        sparesArr[0][1] = 11;
        sparesArr[0][2] = sum;
        int count = 0;
        for (int i = 0; i < 11; i++){
            for (int j = 0; j < 11; j++){
                if (chessArr1[i][j] != 0){
                    count++;
                    sparesArr[count][0] = i;
                    sparesArr[count][1] = j;
                    sparesArr[count][2] = chessArr1[i][j];
                }
            }
        }

        //  压缩后显示
        for (int[] row : sparesArr){
            for (int data : row){
                System.out.printf("%d\t",data);
            }
            System.out.println();
        }

        System.out.println();
        
        //解压缩
        int chessArr2[][] = new int[sparesArr[0][0]][sparesArr[0][1]];
        for (int i = 1; i < sparesArr.length; i++){
            chessArr2[sparesArr[i][0]][sparesArr[i][1]] = sparesArr[i][2];
        }
        for (int[] row : chessArr2){
            for (int data : row){
                System.out.printf("%d\t",data);
            }
            System.out.println();
        }
    }
}