稀疏数组 举例

package fanaa;
/*
\11x11d的数组  
 */
public class Xishushuzu {

    public static void main(String[] args) {
        int[][] a = new int[11][11];
        int count = 0;
        int sum=0;
        a[1][2] = 1;
        a[2][3] = 2;
        for (int i = 0; i < a.length; i++) {
            for (int j = 0; j < a[i].length; j++) {
                System.out.print(a[i][j] + " ");
            }
            System.out.println();

        }


        System.out.println("=======================");
        for (int i = 0; i < a.length; i++)
            for (int j = 0; j < a[i].length; j++) {
                if(a[i][j]!=0)
                sum++;
            }


        int[][] b = new int[sum+1][3];

        b[0][0] = a.length;
        b[0][1] = a[1].length;
        b[0][2] = sum;

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


        }


        for (int[] q : b) {
            for (int t : q) {
                System.out.print(t + " ");
            }
            System.out.println();
        }


        System.out.println("==================");
        //根据稀疏数组还原原数组
        int[][] c=new int[b[0][0]][b[0][1]];

        for (int i = 0; i <b[0][2] ; i++) {
            c[b[i+1][0]][b[i+1][1]]=b[i+1][2];
        }

        for (int[] q : c) {
            for (int t : q) {
                System.out.print(t + " ");
            }
            System.out.println();
        }



    }
}