java 1.85 冒泡排序，稀疏数组

冒泡排序

import java.util.Arrays;

public class Test022 {
    public static void main(String[] args) {
       int[] a={0,1,3,6,8,2,5,47,6,3,58};
      int[] sort= sort(a);

        System.out.println(Arrays.toString(sort));
    }

    public static int[] sort(int[]array){
        int temp=0;//初始化一个临时变量
        boolean flag=false;
        //外层循环，判断执行的次数
        for (int i = 0; i < array.length-1; i++) {
            //内层循环,比较两个数，如果第一个数比第二个数大，则交换位置
            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;
    }
}

输出结果：[0, 1, 3, 6, 8, 2, 5, 47, 6, 3, 58]

稀疏数组

public class Test023 {
    public static void main(String[] args) {
        //创建一个原始数组
        int[][]array=new int[10][10];
        array[0][0]=1;
        array[9][9]=2;
        System.out.println("原始数组为：");
        for (int[] ints : array) {
            for (int anInt : ints) {
                System.out.print(anInt+"\t");
            }
            System.out.println();
        }
        System.out.println();
        System.out.println("==================================");
        //获取有效值的个数
        int sum=0;
        for (int i = 0; i < 10; i++) {
            for (int j = 0; j < 10; j++) {
                if (array[i][j]!=0)
                    sum++;
            }
            
        }
        System.out.println("有效值的个数："+sum);
        System.out.println("=======================================");
//创建一个稀疏数组
        int [][] array2=new int[sum+1][3];
        array2[0][0]=10;
        array2[0][1]=10;
        array2[0][2]=sum;
        //遍历二维数组
        int count=0;
        for (int i = 0; i < array.length; i++) {
            for (int j = 0; j < array[i].length; j++) {
                if (array[i][j]!=0) {
                    count++;
                    array2[count][0]=i;
                    array2[count][1]=j;
                    array2[count][2]=array[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"                );
        }
        System.out.println("================================");
        //还原稀疏数组
        int[][]array3=new int[array2[0][0]][array2[0][1]];
        System.out.println("还原后的稀疏数组：");
        for (int i = 1; i < array2.length; i++) {
            array3[array2[i][0]][array2[i][1]]=array2[i][2];
        }
        //输出还原后的稀疏数组
            for (int[] ints2 : array3) {
                for (int anInt2 : ints2) {
                    System.out.print(anInt2+"\t");
                }
                System.out.println();
            }
           

        }

        }

输出结果：

原始数组为：
1 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 0 0 0 2

==================================

有效值的个数：2

10 10 2

0 0 1

9 9 2

还原后的稀疏数组：
1 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 0 0 0 2