package com.jishu.array;

import java.util.Arrays;

public class arrayDemo04 {
    public static void main(String[] args) {
        //1.創(chuàng)建一個 二維數(shù)組 11*11  0：沒有棋子 ，1：黑棋， 2白棋
        int[][] array1=new int[11][11];
        array1[1][2] =1;
        array1[2][3] =1;

        System.out.println("輸出原始數(shù)據(jù)");
        for (int[] ints : array1) {
            for (int anInt : ints) {
                System.out.print(anInt+"\t");

            }
            System.out.println();

        }
        //轉(zhuǎn)換為稀疏數(shù)組
        //獲取有效值的個數(shù)
        int sum=0;

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

        }
        System.out.println("=======================================");
        System.out.println("輸出有效值"+sum);

        //2.創(chuàng)建一個稀疏數(shù)組
        int[][] array2 = new int[sum+1][3];

        array2[0][0] =11;
        array2[0][1] = 11;
        array2[0][2] = sum;

        //遍歷二維數(shù)組 將非零的值 存放在稀疏數(shù)組中
        int count=0;
        for (int i = 0; i <array1.length ; i++) {
            for (int j = 0; j < array1[i].length ; j++) {
                if(array1[i][j]!=0){
                    count++;
                    array2[count][0]=i;
                    array2[count][1]=j ;
                    array2[count][2]=j ;
                }
            }
        }
        //輸出稀疏數(shù)組
        System.out.println("輸出稀疏數(shù)組");
        for (int i = 0; i <array2.length ; i++) {
            System.out.println(array2[i][0]+
                     "\t"+array2[i][1]+ "\t"+array2[i][2]+ "\t");

        }


    }


}