稀疏数组Java练习代码含IO

是在学习尚硅谷的数据结构与算法Java课程，课后自己凭借思路写的练习代码
首先定义一个稀疏数组类

import java.io.*;
import java.util.Objects;public class SparseArray {int sum;//创建原始数组public int[][] createArray(int column, int row){//根据传入数据定义原始数组大小int[][] array = new int[row][column];//设置一些初始值int position1_row = 1;int position1_column = 2;int position1_value = 1;int position2_row = 3;int position2_column = 4;int position2_value = 2;//赋值初始值，默认值为0, 1表示数据1，2表示数据2System.out.println("生成初始数组如下：");for (int i = 0; i < array.length; i++) {for (int j = 0; j < column; j++) {if (i == position1_row && j == position1_column){array[i][j] = position1_value;}else if (i == position2_row && j == position2_column){array[i][j] = position2_value;}else {array[i][j] = 0;}System.out.printf("%d\t",array[i][j]);}System.out.println();}return array;}//根据原始数组创建稀疏数组public int[][] builtSparseArray(int[][] originalArray){int row = originalArray.length;int column = originalArray[0].length;int sum = 0;for (int i = 0; i < row; i++) {for (int data : originalArray[i]) {if (data != 0){sum++;}}}int[][] sparseArray = new int[sum+1][3];sparseArray[0][0] = row;sparseArray[0][1] = column;sparseArray[0][2] = sum;int count = 1;System.out.println("生成稀疏数组如下");System.out.printf("%d\t%d\t%d\t\n",row,column,sum);for (int i = 0; i < row; i++) {for (int j = 0; j < column; j++) {if (originalArray[i][j] != 0){sparseArray[count][0] = i;sparseArray[count][1] = j;sparseArray[count][2] = originalArray[i][j];System.out.printf("%d\t%d\t%d\t\n",i,j,originalArray[i][j]);count++;}}}return sparseArray;}//根据稀疏数组恢复原始数组public int[][] restoreArray(int[][] sparseArray){int[][] restoredArray = new int[sparseArray[0][0]][sparseArray[0][1]];for (int i = 0; i < sparseArray[0][0]; i++) {for (int j = 0; j < sparseArray[0][1]; j++) {restoredArray[i][j] = 0;}}for(int i = 1; i < sparseArray.length; i++){restoredArray[sparseArray[i][0]][sparseArray[i][1]] = sparseArray[i][2];}System.out.println("复原数组如下：");for (int i = 0; i < sparseArray[0][0]; i++) {for (int j = 0; j < sparseArray[0][1]; j++) {System.out.printf("%d\t",restoredArray[i][j]);}System.out.println();}return restoredArray;}public void saveArray(int[][] array) {BufferedWriter writer = null;try {writer = new BufferedWriter(new FileWriter("sparseArray.txt"));for (int i = 0; i < array.length; i++) {for (int j = 0; j < array[0].length; j++) {int data = array[i][j];writer.write(data+",");}writer.newLine();}writer.close();System.out.println("稀疏数组保存成功");} catch (IOException e) {e.printStackTrace();}}public int[][] readArray(){int [][] sparseArray = null;try {String data;BufferedReader reader = new BufferedReader(new FileReader("sparseArray.txt"));boolean flag = true;int count = 0;System.out.println("读到的稀疏数组如下：");while ((data = reader.readLine()) != null){String[] splits = data.split(",");if (flag){sum = Integer.parseInt(splits[2]);sparseArray = new int[sum+1][3];}flag = false;sparseArray[count][0] = Integer.parseInt(splits[0]);sparseArray[count][1] = Integer.parseInt(splits[1]);sparseArray[count][2] = Integer.parseInt(splits[2]);System.out.printf("%d\t%d\t%d\t\n",sparseArray[count][0],sparseArray[count][1],sparseArray[count][2]);count++;}} catch (FileNotFoundException e) {e.printStackTrace();} catch (IOException e) {e.printStackTrace();}return (Objects.isNull(sparseArray))?null:sparseArray;}
}

然后主类代码


public class Start {public static void main(String[] args) {//定义稀疏数组类对象SparseArray sparseArray = new SparseArray();//创建原始数组int[][] array = sparseArray.createArray(11, 11);//创建稀疏数组int[][] sparseArrayInstance = sparseArray.builtSparseArray(array);//保存稀疏数组sparseArray.saveArray(sparseArrayInstance);//读取稀疏数组int[][] ints = sparseArray.readArray();//恢复原始数组sparseArray.restoreArray(sparseArrayInstance);}
}

打印结果，存储是存到txt文件中

生成初始数组如下：
0	0	0	0	0	0	0	0	0	0	0	
0	0	1	0	0	0	0	0	0	0	0	
0	0	0	0	0	0	0	0	0	0	0	
0	0	0	0	2	0	0	0	0	0	0	
0	0	0	0	0	0	0	0	0	0	0	
0	0	0	0	0	0	0	0	0	0	0	
0	0	0	0	0	0	0	0	0	0	0	
0	0	0	0	0	0	0	0	0	0	0	
0	0	0	0	0	0	0	0	0	0	0	
0	0	0	0	0	0	0	0	0	0	0	
0	0	0	0	0	0	0	0	0	0	0	
生成稀疏数组如下
11	11	2	
1	2	1	
3	4	2	
稀疏数组保存成功
读到的稀疏数组如下：
11	11	2	
1	2	1	
3	4	2	
复原数组如下：
0	0	0	0	0	0	0	0	0	0	0	
0	0	1	0	0	0	0	0	0	0	0	
0	0	0	0	0	0	0	0	0	0	0	
0	0	0	0	2	0	0	0	0	0	0	
0	0	0	0	0	0	0	0	0	0	0	
0	0	0	0	0	0	0	0	0	0	0	
0	0	0	0	0	0	0	0	0	0	0	
0	0	0	0	0	0	0	0	0	0	0	
0	0	0	0	0	0	0	0	0	0	0	
0	0	0	0	0	0	0	0	0	0	0	
0	0	0	0	0	0	0	0	0	0	0	Process finished with exit code 0