layui資料表格批量刪除
阿新 • • 發佈:2020-07-25
稀疏陣列
public class SparseArray { public static void main(String[] args) { //0 代表無棋子 1 代表黑棋 2 代表白棋 int[][] array1 = new int[11][11]; array1[1][2] = 1; array1[2][3] = 2; for (int i = 0; i < array1.length; i++) { for (int j = 0; j < array1[i].length; j++) { System.out.print(array1[i][j] + "\t"); } System.out.println(); } //統計有效數字 int sum = 0; for (int i = 0; i < array1.length; i++) { for (int j = 0; j < array1[i].length; j++) { if (array1[i][j] != 0) { sum++; } } } System.out.println("有效數字為" + sum + "個"); //建立稀疏陣列 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]; } } } //遍歷稀疏陣列 for (int i = 0; i < array2.length; i++) { System.out.println(array2[i][0]+"\t"+array2[i][1]+"\t"+array2[i][2]+"\t"); } //讀取稀疏陣列 int[][] array3 = new int [array2[0][0]][array2[0][1]]; for (int i = 1; i <array2.length ; i++) { array3[array2[i][0]][array2[i][1]]=array2[i][2]; } System.out.println("還原後的的陣列"); for (int i = 0; i < array1.length; i++) { for (int j = 0; j < array3[i].length; j++) { System.out.print(array3[i][j] + "\t"); } System.out.println(); } } }