package cn.mrlij.array;
 
import java.io.BufferedReader;
import java.io.File;
import java.io.FileNotFoundException;
import java.io.FileReader;
import java.io.FileWriter;
import java.io.IOException;
import java.io.Reader;
import java.util.Scanner;
 
/***
 * 實現棋盤的存檔
 * @author dreamer
 *
 */
public class ArrTest {
 public static int[][] newArr(){
 //1.創建一個帶棋盤的二維數組
 int arr[][] = new int[11][11];
 //1 => 黑色 2 => 藍色
 arr[1][2] = 1;
 arr[2][3] = 2;
 System.out.println("原始二維數組~~~");
 for(int[] row : arr) {
  for(int data :row) {
  System.out.printf("%d\t",data);
  }
  System.out.println();
 }
 return arr;
 }
 public static void toXs(int[][] arr) throws IOException{
 //2.轉換稀疏數組
 /**
  *  row col val
  * 0 11 11 2
  */
 //統計二維數組中有效數據的個數，遍歷二維數組
 int sum = 0;
 for(int i = 0;i<11;i++) {
  for(int j = 0;j<11; j++) {
  if(arr[i][j]!=0) {
   sum++;
  }
  }
 }
 System.out.println("有效數據的個數是====>>>>"+sum);
 //根據二維數組創建二維稀疏數組
 int xsarr[] [] = new int[sum+1][3];
 //給稀疏數組賦值，初始化第一行數據
 xsarr[0][0] = 11;
 xsarr[0][1] = 11;
 xsarr[0][2] = sum;
 
 //給余下的行賦值
 int count = 0;
 for(int i = 0; i<11;i++) {
  for(int j = 0; j<11;j++) {
  if(arr[i][j]!=0) {
   count++;
   xsarr[count][0] = i;
   xsarr[count][1] = j;
   xsarr[count][2] = arr[i][j];
  }
  }
 }
 //遍歷稀疏數組
 System.out.println("稀疏數組是~~~~~");
 for(int i = 0;i<xsarr.length;i++) {
  for(int j = 0;j<3;j++) {
  System.out.printf("%d\t",xsarr[i][j]);
  }
  System.out.println();
 }
 File f = new File("D:/save.txt");
 if(f.exists()) {
  f.createNewFile();
 }
 FileWriter fw =new FileWriter(f);
 for(int i = 0;i<xsarr.length;i++) {
  for(int j = 0;j<3;j++) {
  fw.write(xsarr[i][j]+"\t");
  }
  fw.write("\r\n");
 }
 fw.close();
 }
 public static int[][] getXs() throws IOException{
 File f = new File("D:/save.txt");
 Reader r = new FileReader(f);
 int [][] xsarr = new int[3][3];
 BufferedReader br = new BufferedReader(r);
 if(f.exists()) {
  
  int flag = 0;
  String s;
  while((s = br.readLine())!=null) {
  String[] split = s.split("\t");
  for(int i = 0;i<split.length;i++) {
   xsarr[flag][i] = Integer.parseInt(split[i]);
  }
  flag++;
  }
 }
 br.close();
 
 //3.將稀疏數組轉換二維數組
 //創建二維數組(行數為11，列數為11)
 int arr2 [][] = new int[11][11];
 //從稀疏數組的第二行開始遍歷；
 for(int i = 1; i<xsarr.length;i++) {
  //將遍歷的每個值賦值給二維數組
  arr2[xsarr[i][0]][xsarr[i][1]] = xsarr[i][2];
 }
 //轉換之后的二維數組是。。
 System.out.println("轉換的二維數組。。");
 for(int[] row : arr2) {
  for(int data :row) {
  System.out.printf("%d\t",data);
  }
  System.out.println();
 }
 return arr2;
 }
public static void main(String[] args) throws IOException {
 Scanner sc = new Scanner(System.in);
 while(true) {
 System.out.println("1.創建11*11的棋盤并存檔");
 System.out.println("2.讀取上次存檔");
 System.out.println("3.退出");
 int r = sc.nextInt();
 switch(r) {
 case 1: int arr[][] = newArr();
  System.out.println("棋盤已創建！開始存檔！");
  toXs(arr);
  System.out.println("存檔完成！");
  break;
 case 2: getXs();
  break;
 case 3: System.out.println("退出！"); 
  break;
  default:
  break;
  }
 
 }
}
}