数组(二):
知识点:
![在这里插入图片描述](https://img-blog.csdnimg.cn/c32de4cdaa554c8c83642f217372ef95.jpg?x-oss-process=image/watermark,type_ZmFuZ3poZW5naGVpdGk,shadow_10,text_aHR0cHM6Ly9ibG9nLmNzZG4ubmV0L3FxXzQ4NTc5NjAz,size_16,color_FFFFFF,t_70#pic_center)
![在这里插入图片描述](https://img-blog.csdnimg.cn/f0455d778f3c441bbdf9e7e486b7990c.jpg?x-oss-process=image/watermark,type_ZmFuZ3poZW5naGVpdGk,shadow_10,text_aHR0cHM6Ly9ibG9nLmNzZG4ubmV0L3FxXzQ4NTc5NjAz,size_16,color_FFFFFF,t_70#pic_center)
![在这里插入图片描述](https://img-blog.csdnimg.cn/5e3cb3bdf2c6478688fd299f974b9c2b.jpg?x-oss-process=image/watermark,type_ZmFuZ3poZW5naGVpdGk,shadow_10,text_aHR0cHM6Ly9ibG9nLmNzZG4ubmV0L3FxXzQ4NTc5NjAz,size_16,color_FFFFFF,t_70#pic_center)
![在这里插入图片描述](https://img-blog.csdnimg.cn/017e09ad1f49412d9c90f25d19b1ca4e.jpg?x-oss-process=image/watermark,type_ZmFuZ3poZW5naGVpdGk,shadow_10,text_aHR0cHM6Ly9ibG9nLmNzZG4ubmV0L3FxXzQ4NTc5NjAz,size_16,color_FFFFFF,t_70#pic_center)
代码:
public class Demo05 {
public static void main(String[] args) {
int[][] array ={{1,2},{2,3},{3,4},{4,5}};
printArray(array[0]);
for (int i=0;i<array.length;i++){
for (int j=0;j<array[i].length;j++){
System.out.println(array[i][j]);
}
}
}
public static void printArray(int[] arrays){
for (int i=0;i<arrays.length;i++){
System.out.print(arrays[i]+"");
}
}
}
public class Demo06 {
public static void main(String[] args) {
int[] a= {1,2,3,4,90902,31231,543,21,3,23};
System.out.println(a);
Arrays.sort(a);
System.out.println(Arrays.toString(a));
Arrays.fill(a,2,4,0);
System.out.println(Arrays.toString(a));
}
public static void printArray(int[] a){
for (int i=0;i<a.length;i++){
if (i==0){
System.out.print("[");
}
if (i==a.length-1){
System.out.print("]");
}else {
System.out.print(a[i]+",");
}
}
}
}
public class Demo07 {
public static void main(String[] args) {
int[] a={1,4,5,6,72,2,2,2,25,6,7};
int[] sort=sort(a);
System.out.println(Arrays.toString(sort));
}
public static int[] sort(int[] array){
int temp =0;
for (int i = 0; i < array.length-1; i++) {
boolean flag=false;
for (int j = 0; j < array.length-1-i; j++) {
if (array[j+1]<array[j]){
temp=array[j];
array[j]=array[j+1];
array[j+1]=temp;
flag=true;
}
if (flag==false){
break;
}
}
}
return array;
}
}
public class Demo08 {
public static void main(String[] args) {
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);
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("还原");
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[] ints:array3) {
for (int anInt :ints){
System.out.print(anInt+"\t");
}
System.out.println();
}
}
}
的数组:");
for (int[] ints:array3) {
for (int anInt :ints){
System.out.print(anInt+"\t");
}
System.out.println();
}
}
}