通过稀疏数组还原原始数组

import java.util.Scanner;

public class demo2 {
    public static void main(String[] args) {
        //稀疏数组还原
        //给定一个稀疏数组
        int[][] arr = new int[5][3];
        arr[0][0] = 11;
        arr[0][1] = 11;
        arr[0][2] = 4;
        Scanner scan = new Scanner(System.in);
        for(int i=1;i<5;i++){
            for (int j = 0; j < 3; j++) {
                arr[i][j]=scan.nextInt();
            }
        }
        //输出稀疏数组
        for (int[] ar:arr) {
            for (int a:ar) {
                System.out.print(a+"\t");
            }
            System.out.println();
        }

        //创建原始数组
        int[][] number = new int[11][11];
        for (int i = 1; i < arr.length; i++) {
            number[arr[i][0]][arr[i][1]] = arr[i][2];
        }
        System.out.println("输出原始数组");
        //输出原始数组
        for (int[] num:number) {
            for (int n:num) {
                System.out.print(n+"\t");
            }
            System.out.println();
        }

    }
}