//稀疏數(shù)組
public class SparseArray {
	public static void main(String[] args) {
		//創(chuàng)建一個(gè)原始的二維數(shù)組11 * 11
		int[][] chessArr = new int[11][11];
		chessArr[1][2] = 1;
		chessArr[2][3] = 2;
		chessArr[4][5] = 2;
		//輸出原始的二維數(shù)組
		for (int[] row : chessArr) {
			for (int i : row) {
				System.out.printf("%d\t", i);
			}
			System.out.println();
		}

		//二維數(shù)組轉(zhuǎn)稀疏數(shù)組
		//首先遍歷二維數(shù)組，得到非0數(shù)據(jù)的個(gè)數(shù)
		int sum = 0;
		for (int i = 0; i < 11; i++) {
			for (int j = 0; j < 11; j++) {
				if (chessArr[i][j] != 0) {
					sum++;
				}
			}
		}
		//創(chuàng)建對(duì)應(yīng)的稀疏數(shù)組
		int[][] sparseArr = new int[sum + 1][3];
		//對(duì)稀疏數(shù)組賦值
		sparseArr[0][0] = 11;
		sparseArr[0][1] = 11;
		sparseArr[0][2] = sum;
		//遍歷二維數(shù)組，將非0的值存放到稀疏數(shù)組中
		int count = 0;	//用于記錄是第幾個(gè)非0數(shù)據(jù)
		for (int i = 0; i < 11; i++) {
			for (int j = 0; j < 11; j++) {
				if (chessArr[i][j] != 0) {
					count++;
					sparseArr[count][0] = i;
					sparseArr[count][1] = j;
					sparseArr[count][2] = chessArr[i][j];
				}
			}
		}
		//輸出稀疏數(shù)組
		for(int i = 0; i < sparseArr.length; i++) {
			System.out.printf("%d\t%d\t%d\t", sparseArr[i][0], sparseArr[i][1], sparseArr[i][2]);
			System.out.println();
		}

		//稀疏數(shù)組恢復(fù)二維數(shù)組
		//首先讀取稀疏數(shù)組的第一行，根據(jù)第一行的數(shù)據(jù)，創(chuàng)建原始的二維數(shù)組
		int newChessArr[][] = new int[sparseArr[0][0]][sparseArr[0][1]];
		//讀取稀疏數(shù)組后幾行的數(shù)據(jù)，賦值給二維數(shù)組
		for(int i = 1; i < sparseArr.length; i++) {
			newChessArr[sparseArr[i][0]][sparseArr[i][1]] = sparseArr[i][2];
		}
		//輸出恢復(fù)后的二維數(shù)組
		//輸出原始的二維數(shù)組
		for (int[] row : newChessArr) {
			for (int i : row) {
				System.out.printf("%d\t", i);
			}
			System.out.println();
		}
	}
}