1. 程式人生 > 其它 >leetcode 每日一題 942. 增減字串匹配

leetcode 每日一題 942. 增減字串匹配

package Array;

public class ArrayDemo04 {
public static void main(String[] args) {
int [][] array1=new int[11][11];
array1[1][2]=1;
array1[2][3]=2;

//輸出原陣列
for(int [] ints:array1)
{
for (int anInt : ints)
{
System.out.print(anInt+"\t");
}
System.out.println();
}

int sum=0;
for (int[] ints : array1) {
for (int anInt : ints) {
if(anInt !=0)
{
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[] ints : array2) {
for (int anInt : ints) {
System.out.print(anInt+"\t");
}
System.out.println();
}
}
}