稀疏数组练习

示例：
对棋盘进度进行存档时，只有部分位置有棋子，可将 二维 -> 稀疏数组 减少存储空间的浪费，读取时，再从 稀疏数组 -> 二维数组。

import java.util.Scanner;
public class Hello{
    public static void main(String[] args) {
    	// 定义一个二维数组表示棋盘
    	int[][] a = new int[11][11];
    	Scanner in = new Scanner(System.in);
    	System.out.println("输入你想赋值的位置和值，“,”隔开：");
		String[] dir = in.next().split(",");
    	while(Integer.parseInt(dir[0]) > 0){
    		if(Integer.parseInt(dir[0]) > 11 || Integer.parseInt(dir[1]) > 11){
    			System.out.println("数组越界，请重新输入: ");
    			dir = in.next().split(",");
    		}	
    		else{
    			a[Integer.parseInt(dir[0])-1][Integer.parseInt(dir[1])-1] = Integer.parseInt(dir[2]);
    			dir = in.next().split(",");
    		}
    	}
    	System.out.println("二维数组打印如下：");
    	for(int[] i : a){
    		for(int j : i){
        		System.out.print(j+" ");
    		}
    		System.out.println();
    	}


    	// 二维 -> 稀疏
    	// 稀疏第一层存二维行列、有效值个数，先遍历一遍数组得到
    	int count = 0 ;
    	for (int i = 0; i < a.length; i++){
    		for (int j = 0; j < a[i].length; j++){
    			if (a[i][j] > 0){
    				count++;
    			}
    		}
    	}
    	int[][] xishu = new int[count+1][3];
    	xishu[0] = new int[]{11,11,count};
    	int col = 1;
    	for (int i = 0; i < a.length; i++){
    		for (int j = 0; j < a[i].length; j++){
    			if (a[i][j] != 0){
    				xishu[col++] = new int[]{i, j, a[i][j]};
    			}
    		}
    	}
    	System.out.println("二维 -> 稀疏数组：");
    	for (int i = 0; i < xishu.length; i++){
    		for (int j = 0; j < xishu[i].length; j++){
    			System.out.print(xishu[i][j]+" ");
    		}
    		System.out.println();
    	}


    	// 稀疏 -> 二维
    	int[][] two = new int[xishu[0][0]][xishu[0][1]];
    	for (int i = 1; i < xishu.length; i++){
    		two[xishu[i][0]][xishu[i][1]] = xishu[i][2];
    	}
    	System.out.println("稀疏 -> 二维：");
    	for (int i = 0; i < two.length; i++){
    		for (int j = 0; j < two[i].length; j++){
    			System.out.print(two[i][j]+" ");
    		}
    		System.out.println();
    	}
    }
}