public class ArrayDemo08 {public static void main(String[] args) {// 1. 創建一個二維數組 11*11 0: 沒有棋子 1: 黑棋 2: 白棋int[][] array1 = new int[11][11];array1[1][2] = 1;array1[2][3] = 2;// 輸出原始的數組System.out.println("輸出原始的數組");for (int[] ints : array1) {for (int anInt : ints) {System.out.print(anInt + "\t");}System.out.println();}System.out.println("======================");// 轉化為稀疏數組保存// 獲取有效值的個數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("有效值的個數: "+sum);//2. 創建一個稀疏數組int[][] array2 = new int[sum+1][3];array2[0][0] = 11;array2[0][1] = 11;array2[0][2] = sum;// 遍歷二維數組，將非零的值，存放稀疏數組中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] = array1[i][j];}}}// 輸出稀疏 數組System.out.println("稀疏 數組: ");for (int i = 0; i < array2.length; i++) {System.out.println(array2[i][0]+"\t"+array2[i][1]+"\t"+array2[i][2]+"\t");}System.out.println("=======================");System.out.println("還原: ");// 1. 創建新數組int[][] array3 = new int[array2[0][0]][array2[0][1]];// 2. 還原到新數組for (int i = 1; i < array2.length; i++) {array3[array2[i][0]][array2[i][1]] = array2[i][2];}// 3. 打印 還原 數組System.out.println("輸出還原數組: ");for (int[] ints : array3) {for (int anInt : ints) {System.out.print(anInt + "\t");}System.out.println();}} }

運行結果：

輸出原始的數組 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 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 0 0 0 0 0 0 0 0 0 0 0 0 ====================== 有效值的個數: 2 稀疏 數組: 11 11 2 1 2 1 2 3 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 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 0 0 0 0 0 0 0 0 0 0 0 0 Process finished with exit code 0

https://www.bilibili.com/video/BV12J41137hu?p=59&spm_id_from=pageDriver

總結

以上是生活随笔為你收集整理的Java-稀疏数组的全部內容，希望文章能夠幫你解決所遇到的問題。

如果覺得生活随笔網站內容還不錯，歡迎將生活随笔推薦給好友。