package com.guo.operator.array;
import com.sun.java.swing.plaf.windows.WindowsToolBarSeparatorUI;
import java.util.Arrays;
//稀疏矩阵
public class ArrayDemo08 {
public static void main(String[] args) {
//1.创建一个二维数组11*11 0:没有棋子 1:黑棋 2:白棋
int[][] array = new int[11][11];
array[1][2] = 1;
array[2][3] = 2;
//输出原始的数组
System.out.println("输出原始的数组");
//for-each循环输入数组 array.for快捷键
for (int[] ints : array) {
for (int anInt : ints) {
System.out.print(anInt+"\t");
}
System.out.println();
}
//转换为稀疏矩阵进行保存
//获取有效值的个数
int sum = 0;
for (int i = 0; i < 11; i++) {
for (int j = 0; j < 11; j++) {
if(array[i][j]!=0){
sum++;
}
}
}
System.out.println("有效值的个数为:"+sum);
//创建一个稀疏数组的数组
int count = 0;
int[][] array1 = new int[sum+1][3];
array1[0][0] = 11;
array1[0][1] = 11;
array1[0][2] = sum;
for (int i = 0; i < 11; i++) {
for (int j = 0; j < 11; j++) {
if(array[i][j]!=0){
count++;
array1[count][0] = i;
array1[count][1] = j;
array1[count][2] = array[i][j];
}
}
}
System.out.println("====================================");
//打印出稀疏数组,可利用foreach循环
System.out.println("稀疏数组");
for (int[] ints : array1) {
for (int anInt : ints) {
System.out.print(anInt+"\t");
}
System.out.println();
}
System.out.println("====================================");
//利用稀疏数组,还原原先的11*11的数组
int[][] array2 = new int[array1[0][0]][array1[0][1]];
for (int i = 1; i <array1.length ; i++) {
array2[array1[i][0]][array1[i][1]] = array1[i][2];
}
//打印
System.out.println("输出还原的数组");
for (int[] ints : array2) {
for (int anInt : ints) {
System.out.print(anInt+"\t");
}
System.out.println();
}
}
}
JAVA--Array--稀疏矩阵和原始矩阵的转换
最新推荐文章于 2023-06-14 10:05:54 发布